@article{91257b03a80a462a8838abbfbd56dea5,
title = "Time- and Space-optimal Algorithm for the Many-visits TSP",
keywords = "TSP, spanning trees, high-multiplicity scheduling, TRAVELING SALESMAN PROBLEM, DYNAMIC-PROGRAMMING APPROACH, FIXED NUMBER, COMPLEXITY",
author = "Andre Berger and Laszlo Kozma and Matthias Mnich and Roland Vincze",
note = "data source:",
year = "2020",
month = jun,
doi = "10.1145/3382038",
language = "English",
volume = "16",
journal = "ACM Transactions on Algorithms",
issn = "1549-6325",
publisher = "Association for Computing Machinery (ACM)",
number = "3",
}