Part of the Lecture Notes in Computer Science book series (LNCS, volume 4598)
An Improved Exact Algorithm for Cubic Graph TSP
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.251 n ), improving the previous bound O(1.260 n ) by Eppstein.
KeywordsPlanar Graph Minimum Span Tree Travel Salesman Problem Hamiltonian Cycle Free Vertex
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 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
- 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
© Springer-Verlag Berlin Heidelberg 2007