An improved approximation algorithm for TSP with distances one and two

Lecture Notes in Computer Science

Volumn 3623, Issue , 2005, Pages 504-515

  Blaser M ^a   Ram, L Shankar ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; COSTS; GRAPH THEORY; HAMILTONIANS; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; HAMILTONIAN TOUR; UNDIRECTED GRAPHS;

TRAVELING SALESMAN PROBLEM;

EID: 26844548426     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11537311_44     Document Type: Conference Paper

References (9)

1. M. Bläser. A new approximation algorithm for the asymmetric TSP with triangle inequality. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 639-647, 2003.
2. M. Bläser. A 3/4-approximation algorithm for maximum ATSP with weights zero and one. In Proc. 7th Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems, LNCS 3122, pages 61-71, 2004.
3. N. Christofides. Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, GSIA, Carnegie Mellon University, 1976.
4. A. Frieze, G. Galbiati, and F. Maffioli. On the worst-case performance of some algorithms for the asymmetric travelling salesman problem. Networks, 12:23-39, 1982.
5. D. B. Hartvigsen. Extensions of matching theory. PhD thesis, Carnegie-Mellon University, 1984.
6. H. Kaplan, M. Lewenstein, N. Shafrir, and M. Sviridenko. A 2/3 approximation for maximum asymmetric TSP by decomposing directed regular multi graphs. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2003.
7. B. Manthey, On Approximating Restricted Cycle Covers. arXiv:cs.CC/0504038 v1, April 11, 2005.
8. C. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. Math. of Operations Research, 18:1-11, 1993.
9. S. Sahni and T. Gonzalez. P-complete approximation problems. Journal of the ACM, 23:555-565, 1976.