A time- and space-optimal algorithm for the many-visits TSP

DOI10.1137/1.9781611975482.106zbMath1432.68614OpenAlexW4245755206MaRDI QIDQ5236290

Matthias Mnich, André Berger, László Kozma, Roland Vincze

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975482.106

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Related Items (4)

High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system ⋮ Domino sequencing: scheduling with state-based sequence-dependent setup times ⋮ Many-visits TSP revisited ⋮ Approximate Counting of k-Paths: Deterministic and in Polynomial Space

This page was built for publication: A time- and space-optimal algorithm for the many-visits TSP