@InProceedings{chan_et_al:LIPIcs.ESA.2018.15,
author = {Chan, T-H. Hubert and Jiang, Haotian and Jiang, Shaofeng H.-C.},
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:1--15:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.15},
URN = {urn:nbn:de:0030-drops-94781},
doi = {10.4230/LIPIcs.ESA.2018.15},
annote = {Keywords: Doubling Dimension, Traveling Salesman Problem, Polynomial Time Approximation Scheme, Steiner Tree Problem, Prize Collecting}
}