Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Rubinstein, Shlomi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes
Refael Hassin
,
Shlomi Rubinstein
Information Processing Letters
98
(3), 2006, pp. 92-95
Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems
Esther M. Arkin
,
Refael Hassin
,
Shlomi Rubinstein
,
Maxim Sviridenko
Algorithmica
39
(2), 2004, pp. 175-187
An approximation algorithm for maximum triangle packing
Refael Hassin
,
Shlomi Rubinstein
Lecture Notes in Computer Science
3221
, 2004, pp. 403-413
Approximations for Maximum Transportation Problem With Permutable Supply Vector and other capacitated Star Packing problems
Esther M. Arkin
,
Refael Hassin
,
Shlomi Rubinstein
,
Maxim Sviridenko
Lecture Notes in Computer Science
2368
, 2002, pp. 280-287
A
\frac{7}{8}
-approximation algorithm for metric MAX TSP
Refael Hassin
,
Shlomi Rubinstein
Information Processing Letters
81
(5), 2002, pp. 247-251
Robust matchings
Refael Hassin
,
Shlomi Rubinstein
SIAM Journal on Discrete Mathematics
15
(4), 2002, pp. 530-537
Approximation algorithms for maximum linear arrangement
Refael Hassin
,
Shlomi Rubinstein
Information Processing Letters
80
(4), 2001, pp. 171-177
A
\frac{7}{8}
-approximation algorithm for Metric Max TSP
Refael Hassin
,
Shlomi Rubinstein
Lecture Notes in Computer Science
2125
, 2001, pp. 205-209
Better approximations for max TSP
Refael Hassin
,
Shlomi Rubinstein
Information Processing Letters
75
(4), 2000, pp. 181-186
Approximation algorithms for Maximum Linear Arrangement
Refael Hassin
,
Shlomi Rubinstein
Lecture Notes in Computer Science
1851
, 2000, pp. 231-236
Robust matchings and maximum clustering
Refael Hassin
,
Shlomi Rubinstein
Lecture Notes in Computer Science
1851
, 2000, pp. 251-258
An approximation algorithm for the maximum Traveling Salesman problem
Refael Hassin
,
Shlomi Rubinstein
Information Processing Letters
67
(3), 1998, pp. 125-130
An approximation algorithm for maximum packing of 3-edge paths
Refael Hassin
,
Shlomi Rubinstein
Information Processing Letters
63
(2), 1997, pp. 63-67
Approximations for the maximum acyclic subgraph problem
Refael Hassin
,
Shlomi Rubinstein
Information Processing Letters
51
, 1994, pp. 133-140