Highly Influenced

# A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights

@article{Klein2008ALA, title={A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights}, author={Philip N. Klein}, journal={SIAM J. Comput.}, year={2008}, volume={37}, pages={1926-1952} }

- Published 2008 in SIAM J. Comput.
DOI:10.1137/060649562

We give an algorithm requiringO(c1/ǫ 2 n) time to find anǫ-optimal traveling salesman tour in the shortest-path metric defined by an undirected pla nar graph with nonnegative edgelengths. For the case of all lengths equal to 1, the time requi d isO(c1/ǫn).

Highly Cited

This paper has 49 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

34 Citations

49 References

Similar Papers