Improved Inapproximability for TSP

  • Michael Lampis
Conference paper

DOI: 10.1007/978-3-642-32512-0_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7408)
Cite this paper as:
Lampis M. (2012) Improved Inapproximability for TSP. In: Gupta A., Jansen K., Rolim J., Servedio R. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science, vol 7408. Springer, Berlin, Heidelberg


The Traveling Salesman Problem is one of the most studied problems in computational complexity and its approximability has been a long standing open question. Currently, the best known inapproximability threshold known is \(\frac{220}{219}\) due to Papadimitriou and Vempala. Here, using an essentially different construction and also relying on the work of Berman and Karpinski on bounded occurrence CSPs, we give an alternative and simpler inapproximability proof which improves the bound to \(\frac{185}{184}\).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Michael Lampis
    • 1
  1. 1.KTH Royal Institue of TechnologySweden

Personalised recommendations