Shlomi Rubinstein

Affiliations:
  • Tel Aviv University, Israel


According to our database1, Shlomi Rubinstein authored at least 18 papers between 1994 and 2009.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2009
Approximation algorithms for maximum latency and partial cycle cover.
Discret. Optim., 2009

2006
An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes.
Inf. Process. Lett., 2006

Erratum to "An approximation algorithm for maximum triangle packing": [Discrete Applied Mathematics 154 (2006) 971-979].
Discret. Appl. Math., 2006

An approximation algorithm for maximum triangle packing.
Discret. Appl. Math., 2006

2005
On the complexity of the <i>k</i>-customer vehicle routing problem.
Oper. Res. Lett., 2005

2004
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems.
Algorithmica, 2004

2003
Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
Oper. Res. Lett., 2003

2002
Robust Matchings.
SIAM J. Discret. Math., 2002

A 7/8-approximation algorithm for metric Max TSP.
Inf. Process. Lett., 2002

Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems.
Proceedings of the Algorithm Theory, 2002

2001
Approximation algorithms for maximum linear arrangement.
Inf. Process. Lett., 2001

2000
Approximation algorithms for special cases of the maximum quadratic assignment problem
PhD thesis, 2000

Better approximations for max TSP.
Inf. Process. Lett., 2000

Robust Matchings and Maximum Clustering.
Proceedings of the Algorithm Theory, 2000

1998
An Approximation Algorithm for the Maximum Traveling Salesman Problem.
Inf. Process. Lett., 1998

1997
Approximation algorithms for maximum dispersion.
Oper. Res. Lett., 1997

An Approximation Algorithm for Maximum Packing of 3-Edge Paths.
Inf. Process. Lett., 1997

1994
Approximations for the Maximum Acyclic Subgraph Problem.
Inf. Process. Lett., 1994


  Loading...