Time- and Space-optimal Algorithm for the Many-visits TSP

DOI10.1145/3382038zbMath1483.68508arXiv1804.06361OpenAlexW3033696807MaRDI QIDQ4987455

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

Publication date: 3 May 2021

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.06361

zbMATH Keywords

TSPhigh-multiplicity schedulingspanning trees

Mathematics Subject Classification ID

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

Related Items (3)

A 3/2-Approximation for the Metric Many-Visits Path TSP ⋮ On the parameterized complexity of the connected flow and many visits TSP problem ⋮ Many-visits TSP revisited

This page was built for publication: Time- and Space-optimal Algorithm for the Many-visits TSP