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

Édouard Bonnet Yoichi Iwata Bart M. P. Jansen Lukasz Kowalik

Published in: ESA (2019)

Keyphrases

fine grained
traveling salesman problem
bounded degree
bounded treewidth
coarse grained
graph theoretic
combinatorial optimization
access control
decision problems
np complete
tightly coupled
machine learning
optimal solution
data objects
space complexity
data lineage