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}
}
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
34 Citations
49 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 49 references

Approximation algorithms for NP-complete pr oblems on planar graphs

  • B. Baker
  • Journal of the ACM41 (1994), pp. 153–180.
  • 1994
Highly Influential
7 Excerpts

Bidimensionality: new co nnections between FPT algorithms and PTASs,”Proceedings of the 16th

  • E. D. Demain, M. Hajiaghayi
  • Annual ACM-SIAM Symposium on Discre te…
  • 2005
Highly Influential
4 Excerpts

Worst-case analysis of a new heuristi c for the traveling salesman problem

  • N. Christofides
  • J.F. Traub, editor, Symposium on new directions…
  • 1976
Highly Influential
2 Excerpts

A poly nomial-time approximation scheme for Steiner tree in planar graphs

  • G. Borradaile, C. Kenyon-Mathieu, P. Klein
  • Proceedings of the 18th Annual ACM-SIAM Symposium…
  • 2007
2 Excerpts

On the optimality of planar and geometric appr oximation schemes,

  • D. Marx
  • fProceedings of the 48th Annual IEEE Symposium on…
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…