8/7-Approximation algorithm for (1,2)-TSP

Piotr Berman, Marek Karpinski

    Research output: Contribution to conferencePaper

    67 Scopus citations

    Abstract

    We design a polynomial time 8/7-approximation algorithm for the Traveling Salesman Problem in which all distances are either one or two. This improves over the best known approximation factor for that problem. As a direct application we get a 7/6-approximation algorithm for the Maximum Path Cover Problem, similarly improving upon the best known approximation factor for that problem. The result depends on a new method of consecutive path cover improvements and on a new analysis of certain related color alternating paths. This method could be of independent interest.

    Original languageEnglish (US)
    Pages641-648
    Number of pages8
    DOIs
    StatePublished - Feb 28 2006
    EventSeventeenth Annual ACM-SIAM Symposium on Discrete Algorithms - Miami, FL, United States
    Duration: Jan 22 2006Jan 24 2006

    Other

    OtherSeventeenth Annual ACM-SIAM Symposium on Discrete Algorithms
    CountryUnited States
    CityMiami, FL
    Period1/22/061/24/06

    All Science Journal Classification (ASJC) codes

    • Software
    • Mathematics(all)

    Fingerprint Dive into the research topics of '8/7-Approximation algorithm for (1,2)-TSP'. Together they form a unique fingerprint.

  • Cite this

    Berman, P., & Karpinski, M. (2006). 8/7-Approximation algorithm for (1,2)-TSP. 641-648. Paper presented at Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, United States. https://doi.org/10.1145/1109557.1109627