IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v48y2023i4p2304-2307.html
   My bibliography  Save this article

Erratum to “Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems”

Author

Listed:
  • Alice Paul

    (Biostatistics, Brown University, Providence, Rhode Island 02912)

  • Daniel Freund

    (Operations Management, MIT Sloan School of Management, Cambridge, Massachusetts 02142)

  • Aaron Ferber

    (Center for Artificial Intelligence in Society, University of Southern California, Los Angeles, California 90089)

  • David B. Shmoys

    (School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14850)

  • David P. Williamson

    (School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14850)

Abstract

There is an error in our paper [Paul A, Freund D, Ferber A, Shmoys DB, Williamson DP (2020) Budgeted prize-collecting traveling salesman and minimum spanning tree problems. Math. Oper. Res. 45(2):576–590]. In that paper, we consider constrained versions of the prize-collecting traveling salesman and the prize-collecting minimum spanning tree problems. The goal is to maximize the number of vertices in the returned tour/tree subject to a bound on the tour/tree cost. Rooted variants of the problems have the additional constraint that a given vertex, the root, must be contained in the tour/tree. In our previous paper, we present a 2-approximation algorithm for the rooted and unrooted versions of both the tree and tour variants using a parameterized primal–dual approach. Here, we illustrate an error in the proof of a lemma for the rooted version of the algorithm and show that the algorithm has no finite approximation guarantee for the rooted version of the problem. We also show that the lemma and the approximation guarantee of 2 continue to hold true for the unrooted version. This leaves the best-known approximations for the rooted tour an established ( 2 + ϵ ) -approximation algorithm and for the tree variant a previously published poly-log approximation algorithm.

Suggested Citation

  • Alice Paul & Daniel Freund & Aaron Ferber & David B. Shmoys & David P. Williamson, 2023. "Erratum to “Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems”," Mathematics of Operations Research, INFORMS, vol. 48(4), pages 2304-2307, November.
    • Handle: RePEc:inm:ormoor:v:48:y:2023:i:4:p:2304-2307
    DOI: 10.1287/moor.2022.1340
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.1340
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2022.1340?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
    ---><---

    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:inm:ormoor:v:48:y:2023:i:4:p:2304-2307. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.