Fine-grained Complexity Analysis of Two Classic TSP Variants

DOI10.1145/3414845OpenAlexW2486127132MaRDI QIDQ5028342

Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger, Mark T. de Berg

Publication date: 8 February 2022

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

Full work available at URL: https://research.tue.nl/nl/publications/783580a6-48fc-4ea1-9889-cded5248efe0

zbMATH Keywords

traveling salesman problem\(k\)-OPTfine-grained complexitybitonic TSP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood ⋮ An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs

This page was built for publication: Fine-grained Complexity Analysis of Two Classic TSP Variants