An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure
The paper presents an O *(1.2312 n )-time and polynomial-space algorithm for the traveling salesman problem in an n-vertex graph with maximum degree 3. This improves the previous time bound for this problem. Our algorithm is a simple branch-and-search algorithm. The only branch rule is designed on a cut-circuit structure of a graph induced by unprocessed edges. To improve a time bound by a simple analysis on measure and conquer, we introduce an amortization scheme over the cut-circuit structure by defining the measure of an instance to be the sum of not only weights of vertices but also weights of connected components of the induced graph.
KeywordsTraveling Salesman Problem Exact Exponential Algorithms Cubic Graphs Connectivity Measure and Conquer
Unable to display preview. Download preview PDF.
- 1.Bjorklund, A.: Determinant sums for undirected Hamiltonicity. In: Proc. 51st Annual IEEE Symp. on Foundations of Computer Science, pp. 173–182 (2010)Google Scholar
- 7.Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer (2010)Google Scholar
- 11.Nagamochi, H., Ibaraki, T.: Algorithmic Aspects of Graph Connectivities, Encyclopedia of Mathematics and Its Applications. Cambridge University Press (2008)Google Scholar
- 14.Xiao, M., Nagamochi, H.: An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure. CoRR abs/1212.6831 (2012)Google Scholar