An explicit lower bound for TSP with distances one and two

Algorithmica (New York)

Volumn 35, Issue 4, 2003, Pages 301-319

  Engebretsen, Lars ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Approximability; Gadget reductions; Lower bounds; The traveling salesman problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INTEGER PROGRAMMING; LINEAR EQUATIONS; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMABILITY; EQUATION GADGET; GADGET REDUCTIONS; LOWER BOUNDS;

TRAVELING SALESMAN PROBLEM;

EID: 0345702031     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-002-1001-6     Document Type: Article

References (13)

1. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Márió Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, May 1998.
2. Piotr Berman and Marek Karpinski. On some tighter inapproximability results. In Jiří Wiedermann, Peter van Emde Boas, and Mogens Nielsen, editors, Proceedings of 26th International Colloquium on Automata, Languages and Programming, volume 1644 of Lecture Notes in Computer Science, pages 200-209. Springer-Verlag, Berlin, July 1999.
3. Nicos Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report CS-93-13, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 1976.
4. Wenceslas Fernandez de la Vega and Marek Karpinski. On approximation hardness of dense TSP and other path problems. Technical Report TR98-024, Electronic Colloquium on Computational Complexity, April 1998.
5. Dimitris A. Fotakis and Paul G. Spirakis. Graph properties that facilitate travelling. Technical Report TR98-031, Electronic Colloquium on Computational Complexity, June 1998.
6. Alan Frieze, Giulia Galbiati, and Francesco Maffioli. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks, 12(1):23-39, 1982.
7. Johan Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, July 2001.
8. David S. Johnson and Christos H. Papadimitriou. Computational complexity. In Eugene L. Lawler, Jan K. Lenstra, Alexander H. G. Rinnoy Kan, and David B. Shmoys, editors, The Traveling Salesman Problem, chapter 3, pages 37-85. Wiley, New York, 1985.
9. Richard M. Karp Reducibility among combinatorial problems. In Raymond E. Miller and James W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum, New York, 1972.
10. Christos H. Papadimitriou and Mihalis Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43(3):425-440, December 1991.
11. Christos H. Papadimitriou and Mihalis Yannakakis. The traveling salesman problem with distances one and two. Mathematics of Operations Research, 18(1):1-11, February 1993.
12. Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, and David P. Williamson. Gadgets, approximation, and linear programming. SIAM Journal on Computing, 29(6):2074-2097, 2000.
13. Sundar Vishwanathan. An approximation algorithm for the asymmetric travelling salesman problem with distances one and two. Information Processing Letters, 44(6):297-302, December 1992.