Title :
An approximation scheme for planar graph TSP
Author :
Grigni, Michelangelo ; Koutsoupias, Elias ; Papadimitriou, Christos
Author_Institution :
Dept. of Math. & Comput. Sci., Emory Univ., Atlanta, GA, USA
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
Keywords :
approximation theory; computational complexity; graph theory; operations research; travelling salesman problems; approximation scheme; distance metric; planar unweighted graph; polynomial-time; shortest-path metric; traveling salesman problem; Approximation algorithms; Combinatorial mathematics; Computer science; Dynamic programming; Genetic algorithms; Linear programming; Particle separators; Polynomials; Testing; Traveling salesman problems;
Conference_Titel :
Foundations of Computer Science, 1995. Proceedings., 36th Annual Symposium on
Conference_Location :
Milwaukee, WI
Print_ISBN :
0-8186-7183-1
DOI :
10.1109/SFCS.1995.492665
