Skip to main content
SpringerLink
Log in

An Improved Exact Algorithm for Cubic Graph TSP

  • Conference paper
Computing and Combinatorics (COCOON 2007)

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

Included in the following conference series:

Abstract

It is shown that the traveling salesman problem for graphs of degree at most three with n vertices can be solved in time O(1.251n), improving the previous bound O(1.260n) by Eppstein.

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

Access this chapter

Log in via an institution
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.

References

  1. Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. SIAM Journal on Applied Mathematics 10, 196–210 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  2. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)

    MATH  Google Scholar 

  3. Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics 36, 177–189 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  4. Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM Journal on Computing 9, 615–627 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hwang, R.Z., Chang, R.C., Lee, R.C.T.: The Searching over Separators Strategy To Solve Some NP-Hard Problems in Subexponential Time. Algorithmica 9, 398–423 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  6. Iwama, K., Tamaki, S.: Improved Upper Bounds for 3-SAT, 15th annual ACM-SIAM Symposium on Discrete Algorithms. In: Proc. SODA, January 2004, pp. 328–329 (2004)

    Google Scholar 

  7. Woeginger, G.J.: Exact Algorithms for NP-Hard Problems: A Survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol. 2570, pp. 185–207. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Eppstein, D.: The Traveling Salesman Problem for Cubic Graphs. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 307–318. Springer, Heidelberg (2003)

    Google Scholar 

  9. Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient Exact Algorithms on Planar Graphs:Exploiting Sphere Cut Branch Decompositions. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 95–106. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Informatics, Kyoto University, Kyoto 606-8501, Japan

    Kazuo Iwama & Takuya Nakashima

Authors
  1. Kazuo Iwama
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takuya Nakashima
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Guohui Lin

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iwama, K., Nakashima, T. (2007). An Improved Exact Algorithm for Cubic Graph TSP. In: Lin, G. (eds) Computing and Combinatorics. COCOON 2007. Lecture Notes in Computer Science, vol 4598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73545-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73545-8_13

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-73545-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation