Title :
A linear-time approximation scheme for planar weighted TSP
Author :
Klein, Philip N.
Author_Institution :
Brown Univ., Providence, RI, USA
Abstract :
In view of the fact that an ε-optimal tour can be found in the Euclidean case in time that it is polynomial with a fixed degree, independent of ε, it seems natural to ask whether the same holds true for the planar case. We give an algorithm requiring O(c1c2/ n) time to find an ε-optimal traveling salesman tour in the metric defined by a planar graph with nonnegative edge-lengths.
Keywords :
computational complexity; graph theory; travelling salesman problems; ε-optimal traveling salesman tour; linear-time approximation; nonnegative edge-lengths; planar graph; planar weighted TSP; Approximation algorithms; Buildings; Euclidean distance; Linear approximation; Optimization methods; Polynomials; Testing; Traveling salesman problems; Tree graphs; Turning;
Conference_Titel :
Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on
Print_ISBN :
0-7695-2468-0
DOI :
10.1109/SFCS.2005.7
