Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP

Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen, Lukasz Kowalik. Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. In Michael A. Bender, Ola Svensson, Grzegorz Herman, editors, 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany. Volume 144 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]

Abstract

Abstract is missing.