An Approximation Scheme for Planar Graph TSP (1995)
by
Michelangelo Grigni
,
Elias Koutsoupias
,
Christos Papadimitriou
| Citations: | 43 - 7 self |
BibTeX
@MISC{Grigni95anapproximation,
author = {Michelangelo Grigni and Elias Koutsoupias and Christos Papadimitriou},
title = {An Approximation Scheme for Planar Graph TSP},
year = {1995}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
Citations
| 338 | A separator theorem for planar graphs - Lipton, Tarjan - 1979 |
| 260 | Approximation algorithms for NP-complete problems on planar graphs - Baker - 1994 |
| 230 | The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization - LAWLER, LENSTRA, et al. - 1985 |
| 221 | Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem - Christofides - 1976 |
| 141 | Applications of a planar separator theorem - Lipton, Tarjan - 1980 |
| 117 | The Traveling Salesman Problem with Distances One and Two - Papadimitriou, Yannakakis - 1993 |
| 83 | A unified geometric approach to graph separators - Miller, Teng, et al. - 1991 |
| 73 | Finding small simple cycle separators for 2-connected planar graphs - Miller - 1986 |
| 23 | A deterministic linear time algorithm for geometric separators and its applications - Eppstein, Miller, et al. - 1993 |
| 12 | Planar separators and the Euclidean norm - Gazit, Miller - 1990 |
| 7 | complexity classes - Optimization - 1991 |
