@InProceedings{paul_et_al:LIPIcs.ESA.2017.62,
author = {Paul, Alice and Freund, Daniel and Ferber, Aaron and Shmoys, David B. and Williamson, David P.},
title = {{Prize-Collecting TSP with a Budget Constraint}},
booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)},
pages = {62:1--62:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-049-1},
ISSN = {1868-8969},
year = {2017},
volume = {87},
editor = {Pruhs, Kirk and Sohler, Christian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.62},
URN = {urn:nbn:de:0030-drops-78375},
doi = {10.4230/LIPIcs.ESA.2017.62},
annote = {Keywords: approximation algorithms, traveling salesman problem}
}