Advertisement

Approximation Hardness of TSP with Bounded Metrics

  • Lars Engebretsen
  • Marek Karpinski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2076)

Abstract

The general asymmetric (and metric) TSP is known to be approximable only to within an O(log n) factor, and is also known to be approximable within a constant factor as soon as the metric is bounded. In this paper we study the asymmetric and symmetric TSP problems with bounded metrics and prove approximation lower bounds of 101/100 and 203/202, respectively, for these problems. We prove also approximation lower bounds of 321/320 and 743/742 for the asymmetric and symmetric TSP with distances one and two.

Keywords

Travel Salesman Problem Travel Salesman Problem Extra Cost Hamiltonian Path Optimum Tour 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    P. Berman and M. Karpinski. On some tighter inapproximability results. In Proc. 26th ICALP, vol. 1644 of LNCS, pp 200–209, 1999.Google Scholar
  3. 3.
    H.-J. Böckenhauer, J. Hromkovič, 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.Google Scholar
  4. 4.
    H.-J. Böckenhauer and S. Seibert. Improved lower bounds on the approximability of the traveling salesman problem. RAIRO Theoretical Informatics and Applications, 34(3):213–255, 2000.zbMATHCrossRefGoogle Scholar
  5. 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.Google Scholar
  6. 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.CrossRefGoogle Scholar
  7. 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.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    J. Håstad. Some optimal inapproximability results. In Proc. 29th STOC, pp 1–10, 1997.Google Scholar
  9. 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.Google Scholar
  10. 10.
    C. H. Papadimitriou and S. Vempala. On the approximability of the traveling salesman problem. In Proc. 32nd STOC, pp 126–133, 2000.Google Scholar
  11. 11.
    C. H. Papadimitriou and S. Vempala. On the approximability of the traveling salesman problem. Manuscript, 2001.Google Scholar
  12. 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.zbMATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    L. Trevisan. When Hamming meets Euclid: The approximability of geometric TSP and MST. In Proc. 29th STOC, pp 21–29, 1997.Google Scholar
  14. 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.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Lars Engebretsen
    • 1
  • Marek Karpinski
    • 2
  1. 1.MIT Laboratory for Computer ScienceCambridge
  2. 2.Department of Computer ScienceUniversity of BonnBonn

Personalised recommendations