Skip to main content
Article thumbnail
Location of Repository

Polynomial-time Approximation Scheme for Euclidean TSP (Lecture)

By Dana Randall


We present a surprising result that the traveling salesman problem has a polynomial-time approximation scheme when the distances between cities are Euclidean. This result, independently due to Arora and Mitchell [1, 6], hinges on a powerful technique for randomly decomposing the give

Year: 2007
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.