pdf-format: |
|
@InProceedings{paul_et_al:LIPIcs:2017:7837, author = {Alice Paul and Daniel Freund and Aaron Ferber and David B. Shmoys and David P. Williamson}, 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 = {Kirk Pruhs and Christian Sohler}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7837}, URN = {urn:nbn:de:0030-drops-78375}, doi = {10.4230/LIPIcs.ESA.2017.62}, annote = {Keywords: approximation algorithms, traveling salesman problem} }
Keywords: | approximation algorithms, traveling salesman problem | |
Seminar: | 25th Annual European Symposium on Algorithms (ESA 2017) | |
Issue date: | 2017 | |
Date of publication: | 01.09.2017 |