Skip to main content

An Improved Approximation Algorithm for TSP with Distances One and Two

  • Conference paper
Fundamentals of Computation Theory (FCT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3623))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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. 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. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, GSIA, Carnegie Mellon University (1976)

    Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hartvigsen, D.B.: Extensions of matching theory. PhD thesis, Carnegie–Mellon University (1984)

    Google Scholar 

  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. Manthey, B.: On Approximating Restricted Cycle Covers. arXiv:cs.CC/0504038 v1, April 11 (2005)

    Google Scholar 

  8. Papadimitriou, C., Yannakakis, M.: The traveling salesman problem with distances one and two. Math. of Operations Research 18, 1–11 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the ACM 23, 555–565 (1976)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bläser, M., Ram, L.S. (2005). An Improved Approximation Algorithm for TSP with Distances One and Two. In: Liśkiewicz, M., Reischuk, R. (eds) Fundamentals of Computation Theory. FCT 2005. Lecture Notes in Computer Science, vol 3623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11537311_44

Download citation

  • DOI: https://doi.org/10.1007/11537311_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28193-1

  • Online ISBN: 978-3-540-31873-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics