André Berger, László Kozma 0002, Matthias Mnich, Roland Vincze. A time- and space-optimal algorithm for the many-visits TSP. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. pages 1770-1782, SIAM, 2019. [doi]
@inproceedings{Berger0MV19,
title = {A time- and space-optimal algorithm for the many-visits TSP},
author = {André Berger and László Kozma 0002 and Matthias Mnich and Roland Vincze},
year = {2019},
doi = {10.1137/1.9781611975482.106},
url = {https://doi.org/10.1137/1.9781611975482.106},
researchr = {https://researchr.org/publication/Berger0MV19},
cites = {0},
citedby = {0},
pages = {1770-1782},
booktitle = {Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019},
editor = {Timothy M. Chan},
publisher = {SIAM},
isbn = {978-1-61197-548-2},
}