Published in: LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
S. Rathinam, R. Ravi, J. Bae, and K. Sundar. Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman Problem. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 162, pp. 33:1-33:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{rathinam_et_al:LIPIcs.SWAT.2020.33, author = {Rathinam, S. and Ravi, R. and Bae, J. and Sundar, K.}, title = {{Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman Problem}}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)}, pages = {33:1--33:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-150-4}, ISSN = {1868-8969}, year = {2020}, volume = {162}, editor = {Albers, Susanne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2020.33}, URN = {urn:nbn:de:0030-drops-122805}, doi = {10.4230/LIPIcs.SWAT.2020.33}, annote = {Keywords: Approximation Algorithm, Heterogeneous Traveling Salesman Problem, Primal-dual Method} }
Published in: LIPIcs, Volume 45, 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)
Ashish Chiplunkar and Sundar Vishwanathan. Approximating the Regular Graphic TSP in Near Linear Time. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 125-135, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{chiplunkar_et_al:LIPIcs.FSTTCS.2015.125, author = {Chiplunkar, Ashish and Vishwanathan, Sundar}, title = {{Approximating the Regular Graphic TSP in Near Linear Time}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {125--135}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.125}, URN = {urn:nbn:de:0030-drops-56264}, doi = {10.4230/LIPIcs.FSTTCS.2015.125}, annote = {Keywords: traveling salesperson problem, approximation, linear time} }
Feedback for Dagstuhl Publishing