• DocumentCode
    2386879
  • Title

    A linear-time approximation scheme for planar weighted TSP

  • Author

    Klein, Philip N.

  • Author_Institution
    Brown Univ., Providence, RI, USA
  • fYear
    2005
  • fDate
    23-25 Oct. 2005
  • Firstpage
    647
  • Lastpage
    656
  • Abstract
    In view of the fact that an ε-optimal tour can be found in the Euclidean case in time that it is polynomial with a fixed degree, independent of ε, it seems natural to ask whether the same holds true for the planar case. We give an algorithm requiring O(c1c2/ n) time to find an ε-optimal traveling salesman tour in the metric defined by a planar graph with nonnegative edge-lengths.
  • Keywords
    computational complexity; graph theory; travelling salesman problems; ε-optimal traveling salesman tour; linear-time approximation; nonnegative edge-lengths; planar graph; planar weighted TSP; Approximation algorithms; Buildings; Euclidean distance; Linear approximation; Optimization methods; Polynomials; Testing; Traveling salesman problems; Tree graphs; Turning;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on
  • Print_ISBN
    0-7695-2468-0
  • Type

    conf

  • DOI
    10.1109/SFCS.2005.7
  • Filename
    1530756
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2386879