IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v25y2013i2d10.1007_s10878-012-9501-z.html
   My bibliography  Save this article

A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP

Author

Listed:
  • Viet Hung Nguyen

    (Université Pierre et Marie Curie Paris 6)

Abstract

We present a primal-dual ⌈log(n)⌉-approximation algorithm for the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such that the length of the tour plus the sum of penalties associated with vertices not in the tour is as small as possible. The previous algorithm for the problem (V.H. Nguyen and T.T Nguyen in Int. J. Math. Oper. Res. 4(3):294–301, 2012) which is not combinatorial, is based on the Held-Karp relaxation and heuristic methods such as the Frieze et al.’s heuristic (Frieze et al. in Networks 12:23–39, 1982) or the recent Asadpour et al.’s heuristic for the ATSP (Asadpour et al. in 21st ACM-SIAM symposium on discrete algorithms, 2010). Depending on which of the two heuristics is used, it gives respectively 1+⌈log(n)⌉ and $3+ 8\frac{\log(n)}{\log(\log(n))}$ as an approximation ratio. Our algorithm achieves an approximation ratio of ⌈log(n)⌉ which is weaker than $3+ 8\frac{\log(n)}{\log(\log(n))}$ but represents the first combinatorial approximation algorithm for the Asymmetric Prize-Collecting TSP.

Suggested Citation

  • Viet Hung Nguyen, 2013. "A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP," Journal of Combinatorial Optimization, Springer, vol. 25(2), pages 265-278, February.
    • Handle: RePEc:spr:jcomop:v:25:y:2013:i:2:d:10.1007_s10878-012-9501-z
    DOI: 10.1007/s10878-012-9501-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-012-9501-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-012-9501-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Viet Hung Nguyen & Thi Thu Thuy Nguyen, 2012. "Approximating the asymmetric profitable tour," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 4(3), pages 294-301.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:25:y:2013:i:2:d:10.1007_s10878-012-9501-z. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.