Papers
Shlomi Rubinstein
My Ph.D. is from Tel Aviv University.
My supervisor was Prof. Refael Hassin.
-
R. Hassin and S. Rubinstein
Approximations For The Maximum
Acyclic Subgraph
Problem
Information Processing Letters 51
(1994), 133-140
-
R. Hassin and S. Rubinstein
An Approximation Algorithm For
Maximum of 3-edge
Pathes
Information Processing Letters 63
(1997), 63-67.
-
R. Hassin, S. Rubinstein and A. Tamir
Approximation Algorithms for
Maximum
Dispersion
Operations Research Letters 21
(1997), 133-137.
-
R. Hassin and S. Rubinstein
An Approximation Algorithm for the
Maximum Travelling
Salesman Problem
Information Processing Letters 67
(1998),
125-130.
-
R. Hassin and S. Rubinstein
Better Approximations for max TSP
Information Processing Letters 75
(2000), 181-186.
-
R. Hassin and S. Rubinstein
Approximation Algorithms for Maximum
Linear
Arrangement
Information Processing Letters 80
(2001), 171-177.
Also: Proceedings of SWAT 2000, LNCS 1851,
231-236.
-
R. Hassin and S. Rubinstein
A 7/8-approximation algorithm for
metric Max-TSP
Information Processing Letters 81
(2002), 247-251.
Also: Proceedings of WADS 2001, LNCS 2125,
205-209.
-
R. Hassin and S. Rubinstein
Robust Matchings
SIAM Journal on Discrete Mathematics
15 (2002),
530-537.
Also: Proceedings of SWAT 2000, LNCS 1851 ,
251-258.
-
R. Hassin and S. Rubinstein
Approximation algorithms for the
metric maximum clustering
problem with given cluster sizes
Operations Research Letters 31 (2003),
179-184.
-
E. Arkin, R. Hassin, S. Rubinstein and M. Sviridenko
Approximations for maximum transportation problem with permutable
supply vector and other capacitated star packing problems
Algorithmica 39
(2004), 175-187.
Also: Proceedings of SWAT 2002, LNCS 2368,
280-287.
-
R. Hassin and S. Rubinstein
On the complexity of the k-customer
vehicle routing
problem
Operations Research Letters 33
(2004), 71-76.
-
R. Hassin and S. Rubinstein
An approximation algorithm for
maximum triangle packing
Discrete Applied Mathematics 154
(2006), 971-979.
Erratum: Discrete Applied Mathematics 154
(2006), 2620.
Also: Proceedings of ESA 2004, LNCS 3221,
280-287.
- R. Hassin and S. Rubinstein
An improved approximation algorithm for the metric maximum
clustering problem with given cluster sizes
Information Processing Letters 98
(2006), 92-95.
- R. Hassin, A. Levin and S. Rubinstein
Approximation algorithms for maximum latency and partial cycle cover
Discrete Optimization 6
(2009), 197-205.
Back to homepage