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

Piotr Berman, Marek Karpinski

    Research output: Contribution to conferencePaper

    66 Citations (Scopus)

    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

    Fingerprint

    Approximation algorithms
    Approximation Algorithms
    Best Approximation
    Path
    Traveling salesman problem
    Cover
    Polynomials
    Travelling salesman problems
    Color
    Consecutive
    Polynomial time

    All Science Journal Classification (ASJC) codes

    • Software
    • Mathematics(all)

    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
    Berman, Piotr ; Karpinski, Marek. / 8/7-Approximation algorithm for (1,2)-TSP. Paper presented at Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, United States.8 p.
    @conference{c127fd633ec846f4856b5626cf7bdba1,
    title = "8/7-Approximation algorithm for (1,2)-TSP",
    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.",
    author = "Piotr Berman and Marek Karpinski",
    year = "2006",
    month = "2",
    day = "28",
    doi = "10.1145/1109557.1109627",
    language = "English (US)",
    pages = "641--648",
    note = "Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms ; Conference date: 22-01-2006 Through 24-01-2006",

    }

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

    8/7-Approximation algorithm for (1,2)-TSP. / Berman, Piotr; Karpinski, Marek.

    2006. 641-648 Paper presented at Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, United States.

    Research output: Contribution to conferencePaper

    TY - CONF

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

    AU - Berman, Piotr

    AU - Karpinski, Marek

    PY - 2006/2/28

    Y1 - 2006/2/28

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=33244495766&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=33244495766&partnerID=8YFLogxK

    U2 - 10.1145/1109557.1109627

    DO - 10.1145/1109557.1109627

    M3 - Paper

    AN - SCOPUS:33244495766

    SP - 641

    EP - 648

    ER -

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