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

Andre Berger; Laszlo Kozma; Matthias Mnich; Roland Vincze

doi:10.1145/3382038

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

Andre Berger^*, Laszlo Kozma, Matthias Mnich, Roland Vincze

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

Original language	English
Article number	35
Number of pages	22
Journal	ACM Transactions on Algorithms
Volume	16
Issue number	3
DOIs	https://doi.org/10.1145/3382038
Publication status	Published - Jun 2020

Keywords

TSP
spanning trees
high-multiplicity scheduling
TRAVELING SALESMAN PROBLEM
DYNAMIC-PROGRAMMING APPROACH
FIXED NUMBER
COMPLEXITY

Access to Document

10.1145/3382038

Cite this

@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: no data used",

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",

}

TY - JOUR

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

AU - Berger, Andre

AU - Kozma, Laszlo

AU - Mnich, Matthias

AU - Vincze, Roland

N1 - data source: no data used

PY - 2020/6

Y1 - 2020/6

KW - TSP

KW - spanning trees

KW - high-multiplicity scheduling

KW - TRAVELING SALESMAN PROBLEM

KW - DYNAMIC-PROGRAMMING APPROACH

KW - FIXED NUMBER

KW - COMPLEXITY

U2 - 10.1145/3382038

DO - 10.1145/3382038

M3 - Article

VL - 16

JO - ACM Transactions on Algorithms

JF - ACM Transactions on Algorithms

SN - 1549-6325

IS - 3

M1 - 35

ER -