Skip to main content
SpringerLink
Log in

An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

The paper presents a 1.692n n O(1)-time polynomial-space algorithm for the traveling salesman problem in an n-vertex edge-weighted graph with maximum degree 4, which improves the previous results of the 1.890n n O(1)-time polynomial-space algorithm by Eppstein and the 1.733n n O(1)-time exponential-space algorithm by Gebauer.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Bjorklund, A.: Determinant sums for undirected Hamiltonicity. In: Proceedings of the 51st Annual IEEE Symp. on Foundations of Computer Science (FOCS), pp. 173–182 (2010)

  2. Bjorklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: The travelling salesman problem in bounded degree graphs. ACM Trans. Algorithms 8(2), 18 (2012)

    Article  MathSciNet  Google Scholar 

  3. Bodlaender, H.L., Cygan, M., Kratsch, S., Nederlof, J.: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. In: ICALP 2013, LNCS 7965, pp .196–207 (2013)

  4. Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions. Algorithmica 58 (3), 790–810 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Eppstein, D.: Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms. ACM Trans. Algorithms 2(4), 492–509 (2006)

    Article  MathSciNet  Google Scholar 

  6. Eppstein, D.: The traveling salesman problem for cubic graphs. J. Graph Algorithms and Applications 11(1), 61–81 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5) (2009)

  8. Fomin, F.V., Kratsch, D. Springer, Exact Exponential Algorithms (2010)

  9. Gebauer, H.: Finding and enumerating Hamilton cycles in 4-regular graphs. Theor. Comput. Sci. 412(35), 4579–4591 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Iwama, K., Nakashima, T. An improved exact algorithm for cubic graph TSP. In: Lin, G. (ed.) : COCOON, pp. 108–117. LNCS 4598, Heidelberg (2007)

  11. Liśkiewicz, M., Schuster, M.R.: A new upper bound for the traveling salesman problem in cubic graphs. J. Discrete Algorithms 27, 1–20 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  12. Woeginger, G.J. Exact algorithms for NP-hard problems: A survey. In: Junger, M., Reinelt, G., Rinaldi, G. (eds.) : Combinatorial Optimization - Eureka, You Shrink! LNCS 2570, pp. 185–207 (2003)

  13. Xiao, M., Nagamochi, H.: An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure. Algorithmica (2015). doi:10.1007/s00453-015-9970-4

  14. Xiao, M., Nagamochi, H.: An exact algorithm for maximum independent set in degree-5 graphs (2014). Discret. Appl. Math. doi:10.1016/j.dam.2014.07.009

  15. Xiao, M., Nagamochi, H.: An improved exact algorithm for undirected feedback vertex set. J. Comb. Optim. (2014). doi:10.1007/s10878-014-9737-x

  16. Xiao, M., Nagamochi, H.: An improved exact algorithm for TSP in degree-4 graphs. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) : COCOON 2012. LNCS 7434, pp. 74–85 (2012)

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, 610054, China

    Mingyu Xiao

  2. Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Yoshida Honmachi, Sakyo, Kyoto, 606-8501, Japan

    Hiroshi Nagamochi

Authors
  1. Mingyu Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroshi Nagamochi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mingyu Xiao.

Additional information

Supported by NFSC of China under the Grant 61370071.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xiao, M., Nagamochi, H. An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4. Theory Comput Syst 58, 241–272 (2016). https://doi.org/10.1007/s00224-015-9612-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-015-9612-x

Keywords

Search

Navigation