The Two-Stripe Symmetric Circulant TSP is in P
share
The symmetric circulant TSP is a special case of the traveling salesman problem in which edge costs are symmetric and obey circulant symmetry. Despite the substantial symmetry of the input, remarkably little is known about the symmetric circulant TSP, and the complexity of the problem has been an often-cited open question. Considerable effort has been made to understand the case in which only edges of two lengths are allowed to have finite cost: the two-stripe symmetric circulant TSP. In this paper, we resolve the complexity of the two-stripe symmetric circulant TSP. To do so, we reduce two-stripe symmetric circulant TSP to the problem of finding certain minimum-cost Hamiltonian paths on cylindrical graphs. We then solve this Hamiltonian path problem. Our results show that the two-stripe symmetric circulant TSP is in P. Note that a two-stripe symmetric circulant TSP instance consists of a constant number of inputs (including n, the number of cities), so that a polynomial-time algorithm for the decision problem must run in time polylogarithmic in n, and a polynomial-time algorithm for the optimization problem cannot output the tour. We address this latter difficulty by showing that the optimal tour must fall into one of two parameterized classes of tours, and that we can output the class and the parameters in polynomial time. Thus we make a substantial contribution to the set of polynomial-time solvable special cases of the TSP, and take an important step towards resolving the complexity of the general symmetric circulant TSP.
READ FULL TEXT