@InProceedings{kowalik_et_al:LIPIcs.ESA.2020.66,
author = {Kowalik, {\L}ukasz and Li, Shaohua and Nadara, Wojciech and Smulewicz, Marcin and Wahlstr\"{o}m, Magnus},
title = {{Many Visits TSP Revisited}},
booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)},
pages = {66:1--66:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-162-7},
ISSN = {1868-8969},
year = {2020},
volume = {173},
editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.66},
URN = {urn:nbn:de:0030-drops-129329},
doi = {10.4230/LIPIcs.ESA.2020.66},
annote = {Keywords: many visits traveling salesman problem, exponential algorithm}
}