Advertisement

An Improved Approximation Algorithm for TSP with Distances One and Two

  • M. Bläser
  • L. Shankar Ram
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3623)

Abstract

The minimum traveling salesman problem with distances one and two is the following problem: Given a complete undirected graph G=(V,E) with a cost function w: E→ {1, 2}, find a Hamiltonian tour of minimum cost. In this paper, we provide an approximation algorithm for this problem achieving a performance guarantee of \(\frac{315}{271}\). This algorithm can be further improved obtaining a performance guarantee of \(\frac{65}{56}\). This is better than the one achieved by Papadimitriou and Yannakakis [8], with a ratio \(\frac{7}{6}\), more than a decade ago. We enhance their algorithm by an involved procedure and find an improved lower bound for the cost of an optimal Hamiltonian tour.

Keywords

Approximation Algorithm Travel Salesman Problem Travel Salesman Problem Performance Guarantee Span Subgraph 
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.
    Bläser, M.: A new approximation algorithm for the asymmetric TSP with triangle inequality. In: Proceedings of the 14th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA), pp. 639–647 (2003)Google Scholar
  2. 2.
    Bläser, M.: A 3/4-approximation algorithm for maximum ATSP with weights zero and one. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 61–71. Springer, Heidelberg (2004)Google Scholar
  3. 3.
    Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, GSIA, Carnegie Mellon University (1976)Google Scholar
  4. 4.
    Frieze, A., Galbiati, G., Maffioli, F.: On the worst–case performance of some algorithms for the asymmetric travelling salesman problem. Networks 12, 23–39 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Hartvigsen, D.B.: Extensions of matching theory. PhD thesis, Carnegie–Mellon University (1984)Google Scholar
  6. 6.
    Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: 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)Google Scholar
  7. 7.
    Manthey, B.: On Approximating Restricted Cycle Covers. arXiv:cs.CC/0504038 v1, April 11 (2005)Google Scholar
  8. 8.
    Papadimitriou, C., Yannakakis, M.: The traveling salesman problem with distances one and two. Math. of Operations Research 18, 1–11 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the ACM 23, 555–565 (1976)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • M. Bläser
    • 1
  • L. Shankar Ram
    • 1
  1. 1.Institut für Theoretische InformatikETH ZürichZürichSwitzerland

Personalised recommendations