Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

FOCS
1995
IEEE

favoriteEmaildiscussreport

119views Theoretical Computer Science» more FOCS 1995»

An Approximation Scheme for Planar Graph TSP

14 years 3 months ago

An Approximation Scheme for Planar Graph TSP

Download www.mathcs.emory.edu

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.

Michelangelo Grigni, Elias Koutsoupias, Christos H

Real-time Traffic

FOCS 1995 | Planar Unweighted Graph | Polynomial-time Approximation Scheme | Theoretical Computer Science | Traveling Salesman Problem |

claim paper

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	FOCS
Authors	Michelangelo Grigni, Elias Koutsoupias, Christos H. Papadimitriou

Comments (0)