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 journalArticleAcademicpeer-review

Original languageEnglish
Article number35
Number of pages22
JournalACM Transactions on Algorithms
Volume16
Issue number3
DOIs
Publication statusPublished - Jun 2020

Keywords

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

Cite this