License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2017.62
URN: urn:nbn:de:0030-drops-78375
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7837/
Go to the corresponding LIPIcs Volume Portal


Paul, Alice ; Freund, Daniel ; Ferber, Aaron ; Shmoys, David B. ; Williamson, David P.

Prize-Collecting TSP with a Budget Constraint

pdf-format:
LIPIcs-ESA-2017-62.pdf (0.5 MB)


Abstract

We consider constrained versions of the prize-collecting traveling salesman and the 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. We present a 2-approximation algorithm for these problems based on a primal-dual approach. The algorithm relies on finding a threshold value for the dual variable corresponding to the budget constraint in the primal and then carefully constructing a tour/tree that is just within budget. Thereby, we improve the best-known guarantees from 3+epsilon and 2+epsilon for the tree and the tour version, respectively. Our analysis extends to the setting with weighted vertices, in which we want to maximize the total weight of vertices in the tour/tree subject to the same budget constraint.

BibTeX - Entry

@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: 31.08.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI