An Approximation Scheme for Planar Graph TSP

Michelangelo Grigni, Elias Koutsoupias, Christos H. Papadimitriou

Abstract: We consider the special case of the traveling salesman problem (TSP) in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial-time approximation scheme (PTAS) for this problem.