Sciweavers

FOCS
1995
IEEE
14 years 4 months ago
An Approximation Scheme for Planar Graph TSP
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...
Michelangelo Grigni, Elias Koutsoupias, Christos H...