 | 2009 |
|---|
| 20 |       | Refael Hassin,
Asaf Levin,
Shlomi Rubinstein:
Approximation algorithms for maximum latency and partial cycle cover.
Discrete Optimization 6(2): 197-205 (2009) |
| 2006 |
|---|
| 19 | | Refael Hassin,
Shlomi Rubinstein:
Erratum to "An approximation algorithm for maximum triangle packing": [Discrete Applied Mathematics 154 (2006) 971-979].
Discrete Applied Mathematics 154(18): 2620 (2006) |
| 18 | | Refael Hassin,
Shlomi Rubinstein:
An approximation algorithm for maximum triangle packing.
Discrete Applied Mathematics 154(6): 971-979 (2006) |
| 17 | | Refael Hassin,
Shlomi Rubinstein:
An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes.
Inf. Process. Lett. 98(3): 92-95 (2006) |
| 2005 |
|---|
| 16 | | Refael Hassin,
Shlomi Rubinstein:
On the complexity of the k-customer vehicle routing problem.
Oper. Res. Lett. 33(1): 71-76 (2005) |
| 2004 |
|---|
| 15 | | Refael Hassin,
Shlomi Rubinstein:
An Approximation Algorithm for Maximum Triangle Packing.
ESA 2004: 403-413 |
| 14 | | Esther M. Arkin,
Refael Hassin,
Shlomi Rubinstein,
Maxim Sviridenko:
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems.
Algorithmica 39(2): 175-187 (2004) |
| 2003 |
|---|
| 13 | | Refael Hassin,
Shlomi Rubinstein:
Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
Oper. Res. Lett. 31(3): 179-184 (2003) |
| 2002 |
|---|
| 12 | | Esther M. Arkin,
Refael Hassin,
Shlomi Rubinstein,
Maxim Sviridenko:
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems.
SWAT 2002: 280-287 |
| 11 | | Refael Hassin,
Shlomi Rubinstein:
A 7/8-approximation algorithm for metric Max TSP.
Inf. Process. Lett. 81(5): 247-251 (2002) |
| 10 | | Refael Hassin,
Shlomi Rubinstein:
Robust Matchings.
SIAM J. Discrete Math. 15(4): 530-537 (2002) |
| 2001 |
|---|
| 9 | | Refael Hassin,
Shlomi Rubinstein:
A 7/8-Approximation Algorithm for Metric Max TSP.
WADS 2001: 205-209 |
| 8 | | Refael Hassin,
Shlomi Rubinstein:
Approximation algorithms for maximum linear arrangement.
Inf. Process. Lett. 80(4): 171-177 (2001) |
| 2000 |
|---|
| 7 | | Refael Hassin,
Shlomi Rubinstein:
Approximation Algorithms for Maximum Linear Arrangement.
SWAT 2000: 231-236 |
| 6 | | Refael Hassin,
Shlomi Rubinstein:
Robust Matchings and Maximum Clustering.
SWAT 2000: 251-258 |
| 5 | | Refael Hassin,
Shlomi Rubinstein:
Better approximations for max TSP.
Inf. Process. Lett. 75(4): 181-186 (2000) |
| 1998 |
|---|
| 4 | | Refael Hassin,
Shlomi Rubinstein:
An Approximation Algorithm for the Maximum Traveling Salesman Problem.
Inf. Process. Lett. 67(3): 125-130 (1998) |
| 1997 |
|---|
| 3 | | Refael Hassin,
Shlomi Rubinstein:
An Approximation Algorithm for Maximum Packing of 3-Edge Paths.
Inf. Process. Lett. 63(2): 63-67 (1997) |
| 2 | | Refael Hassin,
Shlomi Rubinstein,
Arie Tamir:
Approximation algorithms for maximum dispersion.
Oper. Res. Lett. 21(3): 133-137 (1997) |
| 1994 |
|---|
| 1 |  | Refael Hassin,
Shlomi Rubinstein:
Approximations for the Maximum Acyclic Subgraph Problem.
Inf. Process. Lett. 51(3): 133-140 (1994) |
