Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP.
Édouard BonnetYoichi IwataBart M. P. JansenLukasz KowalikPublished in: CoRR (2019)
Keyphrases
- fine grained
- traveling salesman problem
- bounded degree
- coarse grained
- combinatorial optimization
- bounded treewidth
- graph theoretic
- access control
- computational complexity
- tightly coupled
- ant colony optimization
- graph theory
- optimal solution
- decision problems
- databases
- information extraction
- np hard
- special case
- search space
- reinforcement learning