Approximation hardness of TSP with bounded metrics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 201-212

  Engebretsen, Lars ^a   Karpinski, Marek ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; COMPUTATIONAL LINGUISTICS;

APPROXIMATION HARDNESS; APPROXIMATION LOWER BOUNDS; CONSTANT FACTORS; TSP PROBLEMS;

AUTOMATA THEORY;

EID: 84879532416     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_17     Document Type: Conference Paper

References (14)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501-555, 1998.
2. P. Berman and M. Karpinski. On some tighter inapproximability results. In Proc. 26th ICALP, vol. 1644 of LNCS, pp 200-209, 1999.
3. H.-J. B̈ockenhauer, J. Hromkovic, R. Klasing, S. Seibert, and W. Unger. An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality. In Proc. 17th STACS, vol. 1770 of LNCS, pp 382-391, 2000.
4. H.-J. B̈ockenhauer and S. Seibert. Improved lower bounds on the approximability of the traveling salesman problem. RAIRO Theoretical Informatics and Applications, 34(3):213-255, 2000.
5. N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report CS-93-13, GSIA, Carnegie Mellon University, 1976.
6. L. Engebretsen. An explicit lower bound for TSP with distances one and two. In Proc. 16th STACS, vol. 1563 of LNCS, pp 373-382, 1999.
7. A. Frieze, G. Galbiati, and F. Maffioli. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks, 12(1):23-39, 1982.
8. J. Hastad. Some optimal inapproximability results. In Proc. 29th STOC, pp 1-10, 1997.
9. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pp 85-103. Plenum Press, New York, 1972.
10. C. H. Papadimitriou and S. Vempala. On the approximability of the traveling salesman problem. In Proc. 32nd STOC, pp 126-133, 2000.
11. C. H. Papadimitriou and S. Vempala. On the approximability of the traveling salesman problem. Manuscript, 2001.
12. C. H. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. Math. of Oper. Res. , 18(1):1-11, 1993.
13. L. Trevisan. When Hamming meets Euclid: The approximability of geometric TSP and MST. In Proc. 29th STOC, pp 21-29, 1997.
14. S. Vishwanathan. An approximation algorithm for the asymmetric travelling salesman problem with distances one and two. Inf. Process. Lett. , 44(6):297-302, 1992.