Chan, TH. Hubert ;
Jiang, Haotian ;
Jiang, Shaofeng H.C.
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics
Abstract
We present a unified (randomized) polynomialtime approximation scheme (PTAS) for the prize collecting traveling salesman problem (PCTSP) and the prize collecting Steiner tree problem (PCSTP) in doubling metrics. Given a metric space and a penalty function on a subset of points known as terminals, a solution is a subgraph on points in the metric space, whose cost is the weight of its edges plus the penalty due to terminals not covered by the subgraph. Under our unified framework, the solution subgraph needs to be Eulerian for PCTSP, while it needs to be a tree for PCSTP. Before our work, even a QPTAS for the problems in doubling metrics is not known.
Our unified PTAS is based on the previous dynamic programming frameworks proposed in [Talwar STOC 2004] and [Bartal, Gottlieb, Krauthgamer STOC 2012]. However, since it is unknown which part of the optimal cost is due to edge lengths and which part is due to penalties of uncovered terminals, we need to develop new techniques to apply previous divideandconquer strategies and sparse instance decompositions.
BibTeX  Entry
@InProceedings{chan_et_al:LIPIcs:2018:9478,
author = {TH. Hubert Chan and Haotian Jiang and Shaofeng H.C. Jiang},
title = {{A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {15:115:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770811},
ISSN = {18688969},
year = {2018},
volume = {112},
editor = {Yossi Azar and Hannah Bast and Grzegorz Herman},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9478},
URN = {urn:nbn:de:0030drops94781},
doi = {10.4230/LIPIcs.ESA.2018.15},
annote = {Keywords: Doubling Dimension, Traveling Salesman Problem, Polynomial Time Approximation Scheme, Steiner Tree Problem, Prize Collecting}
}
2018
Keywords: 

Doubling Dimension, Traveling Salesman Problem, Polynomial Time Approximation Scheme, Steiner Tree Problem, Prize Collecting 
Seminar: 

26th Annual European Symposium on Algorithms (ESA 2018)

Issue date: 

2018 
Date of publication: 

2018 