Fine-grained complexity of k-OPT in bounded-degree graphs for solving TSP

Édouard Bonnet, Yoichi Iwata, Bart M.P. Jansen, Łukasz Kowalik

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

5 Citations (Scopus)
91 Downloads (Pure)


The Traveling Salesman Problem asks to find a minimum-weight Hamiltonian cycle in an edge-weighted complete graph. Local search is a widely-employed strategy for finding good solutions to TSP. A popular neighborhood operator for local search is k-opt, which turns a Hamiltonian cycle C into a new Hamiltonian cycle C' by replacing k edges. We analyze the problem of determining whether the weight of a given cycle can be decreased by a k-opt move. Earlier work has shown that (i) assuming the Exponential Time Hypothesis, there is no algorithm that can detect whether or not a given Hamiltonian cycle C in an n-vertex input can be improved by a k-opt move in time f(k)n o(k/ log k) for any function f, while (ii) it is possible to improve on the brute-force running time of O(n k) and save linear factors in the exponent. Modern TSP heuristics are very successful at identifying the most promising edges to be used in k-opt moves, and experiments show that very good global solutions can already be reached using only the top-O(1) most promising edges incident to each vertex. This leads to the following question: can improving k-opt moves be found efficiently in graphs of bounded degree? We answer this question in various regimes, presenting new algorithms and conditional lower bounds. We show that the aforementioned ETH lower bound also holds for graphs of maximum degree three, but that in bounded-degree graphs the best improving k-move can be found in time O(n (23/135+ϵk)k), where lim k→∞ ϵk= 0. This improves upon the best-known bounds for general graphs. Due to its practical importance, we devote special attention to the range of k in which improving k-moves in bounded-degree graphs can be found in quasi-linear time. For k ≤ 7, we give quasi-linear time algorithms for general weights. For k = 8 we obtain a quasi-linear time algorithm when the weights are bounded by O(polylog n). On the other hand, based on established fine-grained complexity hypotheses about the impossibility of detecting a triangle in edge-linear time, we prove that the k = 9 case does not admit quasi-linear time algorithms. Hence we fully characterize the values of k for which quasi-linear time algorithms exist for polylogarithmic weights on bounded-degree graphs.

Original languageEnglish
Title of host publication27th Annual European Symposium on Algorithms (ESA 2019)
EditorsMichael A. Bender, Ola Svensson, Grzegorz Herman
Place of PublicationDagstuhl
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Number of pages14
ISBN (Print)978-3-95977-124-5
Publication statusPublished - Sept 2019
Event27th Annual European Symposium on Algorithms - Munich, Germany
Duration: 9 Sept 201911 Sept 2019

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
ISSN (Print)1868-8969


Conference27th Annual European Symposium on Algorithms
Abbreviated titleESA 2019
Internet address


  • Bounded degree
  • K-OPT
  • Traveling salesman problem


Dive into the research topics of 'Fine-grained complexity of k-OPT in bounded-degree graphs for solving TSP'. Together they form a unique fingerprint.

Cite this