A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights

We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgelengths. For the case of all lengths equal to 1, the time required is O(c1/n).

• Type: Journal
• Year: 2008
• Where: SIAMCOMP
• Authors: Philip N. Klein
• Keywords: Nonnegative Edgelengths, SIAMCOMP 2008, Traveling Salesman Tour, Undirected Planar Graph