Abstract
This paper presents the first polynomial-space exact algorithm specialized for the TSP in graphs with degree at most 6. We develop a set of branching rules to aid the analysis of the branching algorithm. Using the measure-and-conquer method, we show that when applied to an n-vertex graph with degree at most 6, the algorithm has a running time of \(O^*(3.0335^n)\), which is still advantageous over other known polynomial-space algorithms for the TSP in general graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Akiba, T., Iwata, Y.: Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover. In: Proceedings of the 17th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 70–81. SIAM (2015)
Eppstein, D.: Quasiconvex analysis of backtracking algorithms. In: Proceedings of the 15th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA 2004), pp. 781–790. ACM Press (2004)
Eppstein, D.: The traveling salesman problem for cubic graphs. J. Graph Algorithms Appl. 11(1), 61–81 (2007)
Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM (JACM), 56(6), Article no. 25 (2009)
Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Heidelberg (2010)
Gurevich, Y., Shelah, S.: Expected computation time for Hamiltonian path problem. SIAM J. Comput. 16(3), 486–502 (1987)
Iwama, K., Nakashima, T.: An improved exact algorithm for cubic graph TSP. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 108–117. Springer, Heidelberg (2007)
Liskiewicz, M., Schuster, M.R.: A new upper bound for the traveling salesman problem in cubic graphs. Arxiv preprint (2012)
Md Yunos, N., Shurbevski, A., Nagamochi, H.: A polynomial-space exact algorithm for TSP in degree-5 graphs. In: The \(12^{\rm {th}}\) International Symposium on Operations Research and Its Applications (ISORA 2015), pp. 45–58 (2015)
Md Yunos, N., Shurbevski, A., Nagamochi, H.: A polynomial-space exact algorithm for TSP in degree-6 graphs. Technical report 2015–003, Department of Applied Mathematics and Physics, Kyoto University (2015). http://www.amp.i.kyoto-u.ac.jp/tecrep/ps_file/2015/2015-003.pdf
Md Yunos, N., Shurbevski, A., Nagamochi, H.: Time bound on polynomial-space exact algorithms for TSP in degree-5 and degree-6 graphs. Technical report, 2015–004, Department of Applied Mathematics and Physics, Kyoto University (2015). http://www.amp.i.kyoto-u.ac.jp/tecrep/ps_file/2015/2015-004.pdf
Xiao, M., Nagamochi, H.: An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure. Algorithmica 74(2), 713–741 (2016)
Xiao, M., Nagamochi, H.: Exact algorithms for maximum independent set. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 328–338. Springer, Heidelberg (2013)
Xiao, M., Nagamochi, H.: An improved exact algorithm for TSP in graphs of maximum degree 4. Theory Comput. Syst. 58(2), 241–272 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Md Yunos, N., Shurbevski, A., Nagamochi, H. (2016). A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs. In: Akiyama, J., Ito, H., Sakai, T., Uno, Y. (eds) Discrete and Computational Geometry and Graphs. JCDCGG 2015. Lecture Notes in Computer Science(), vol 9943. Springer, Cham. https://doi.org/10.1007/978-3-319-48532-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-48532-4_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-48531-7
Online ISBN: 978-3-319-48532-4
eBook Packages: Computer ScienceComputer Science (R0)