The Travelling Salesman Problem in Bounded Degree Graphs

Authors:
Andreas Björklund;Thore Husfeldt;Petteri Kaski;Mikko Koivisto
Affiliations:
Department of Computer Science, Lund University, Lund, Sweden SE-22100;Department of Computer Science, Lund University, Lund, Sweden SE-22100;Helsinki Institute for Information Technology HIIT, Department of Computer Science, University of Helsinki, Finland FI-00014;Helsinki Institute for Information Technology HIIT, Department of Computer Science, University of Helsinki, Finland FI-00014
Venue:
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Year:
2008

Citing 0
Cited 11

Searching Trees: An Essay

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Set multi-covering via inclusion-exclusion

Theoretical Computer Science
A space-time tradeoff for permutation problems

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Optimizing regular edge labelings

GD'10 Proceedings of the 18th international conference on Graph drawing
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs

Journal of Combinatorial Theory Series B
Breaking the 2n-barrier for Irredundance: Two lines of attack

Journal of Discrete Algorithms
Finding and enumerating Hamilton cycles in 4-regular graphs

Theoretical Computer Science
An exact algorithm for the Boolean connectivity problem for k-CNF

Theoretical Computer Science
The traveling salesman problem in bounded degree graphs

ACM Transactions on Algorithms (TALG)
An exact algorithm for the boolean connectivity problem for k-CNF

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Irredundant set faster than O(2n)

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity

Quantified Score

Hi-index	0.01

Visualization

Abstract

We show that the travelling salesman problem in bounded-degreegraphs can be solved in time $O\bigl((2-\epsilon)^n\bigr)$, whereε 0 depends only on the degree bound but noton the number of cities, n. The algorithm is a variant ofthe classical dynamic programming solution due to Bellman, and,independently, Held and Karp. In the case of bounded integerweights on the edges, we also present a polynomial-space algorithmwith running time $O\bigl((2-\epsilon)^n\bigr)$ on bounded-degreegraphs.