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

Alice Paul
Corresponding Author
Alice Paul
[email protected]
https://orcid.org/0000-0001-5932-4809
Biostatistics, Brown University, Providence, Rhode Island 02912;
Search for more papers by this author
,
Daniel Freund
Daniel Freund
[email protected]
https://orcid.org/0000-0001-8039-9805
Operations Management, MIT Sloan School of Management, Cambridge, Massachusetts 02142;
Search for more papers by this author
,
Aaron Ferber
Aaron Ferber
[email protected]
Center for Artificial Intelligence in Society, University of Southern California, Los Angeles, California 90089;
Search for more papers by this author
,
David B. Shmoys
David B. Shmoys
[email protected]
School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14850
Search for more papers by this author
,
David P. Williamson
David P. Williamson
[email protected]
School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14850
Search for more papers by this author

Alice Paul

Corresponding Author

Alice Paul

[email protected]

https://orcid.org/0000-0001-5932-4809

Biostatistics, Brown University, Providence, Rhode Island 02912;

Search for more papers by this author

Daniel Freund

[email protected]

https://orcid.org/0000-0001-8039-9805

Operations Management, MIT Sloan School of Management, Cambridge, Massachusetts 02142;

Search for more papers by this author

Aaron Ferber

[email protected]

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

Search for more papers by this author

David B. Shmoys

[email protected]

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

Search for more papers by this author

David P. Williamson

[email protected]

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

Search for more papers by this author

Published Online:12 Dec 2022https://doi.org/10.1287/moor.2022.1340

References

[1] Chekuri C, Korula N, Pál M (2012) Improved algorithms for orienteering and related problems. ACM Trans. Algorithms 8(3):23:1–23:27.Crossref, Google Scholar
[2] Ghuge R, Nagarajan V (2022) Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems. Math. Oper. Res. 47(2):1612–1630.Link, Google Scholar
[3] 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.Link, Google Scholar

cover image Mathematics of Operations Research

Volume 48, Issue 4

November 2023

Pages 1811-2382, C2

Article Information

Metrics

Information

Received:April 25, 2022
Accepted:October 29, 2022
Published Online:December 12, 2022

Cite as

Alice Paul, Daniel Freund, Aaron Ferber, David B. Shmoys, David P. Williamson (2022) Erratum to “Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems”. Mathematics of Operations Research 48(4):2304-2307.

https://doi.org/10.1287/moor.2022.1340

Keywords

Acknowledgments

The authors thank Lei Lai and Fabian Spaeh for pointing out the example in Section 3, which led to the discovery of this error.

PDF download

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

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

References

Volume 48, Issue 4

Article Information

Metrics

Information

Cite as

Keywords

Sign Up for INFORMS Publications Updates and News