Abstract
We show that the travelling salesman problem in bounded-degree graphs can be solved in time O((2-ε)n) where ε > 0 depends only on the degree bound but not on the number of cities, n. The algorithm is a variant of the classical dynamic programming solution due to Bellman, and, independently, Held and Karp. In the case of bounded integer weights on the edges, we also present a polynomial-space algorithm with running time O((2-ε)n) on bounded-degree graphs. © 2008 Springer-Verlag.
Cite
CITATION STYLE
Björklund, A., Husfeldt, T., Kaski, P., & Koivisto, M. (2008). The travelling salesman problem in bounded degree graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5125 LNCS, pp. 198–209). https://doi.org/10.1007/978-3-540-70575-8_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
