Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Haim Kaplan
- Moshe Lewenstein
- et al.
- 2005
- Journal of the ACM
Publications
Date
Featured collections
Popular topics
13 results for Moshe Lewenstein
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Haim Kaplan
- Moshe Lewenstein
- et al.
- 2003
- FOCS 2003
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- H. Kaplan
- M. Lewenstein
- et al.
- 2003
- FOCS 2003
Multidimensional matching and fast search in suffix trees
- Richard Cole
- Moshe Lewenstein
- 1998
- SODA 1998
Approximating asymmetric maximum TSP
- Moshe Lewenstein
- Maxim Sviridenko
- 1998
- SODA 1998
On demand string sorting over unbounded alphabets
- Carmel Kent
- Moshe Lewenstein
- et al.
- 2012
- Theoretical Computer Science
On the longest common rigid subsequence problem
- Nikhil Bansal
- Moshe Lewenstein
- et al.
- 2008
- Algorithmica (New York)
Constructive bounds on ordered factorizations
- Don Coppersmith
- Moshe Lewenstein
- 2005
- SIAM Journal on Discrete Mathematics
An improved upper bound for the TSP in cubic 3-edge-connected graphs
- David Gamarnik
- Moshe Lewenstein
- et al.
- 2005
- Operations Research Letters
A 5/8 approximation algorithm for the maximum asymmetric TSP
- Moshe Lewenstein
- Maxim Sviridenko
- 2003
- SIAM Journal on Discrete Mathematics