Fine-grained Complexity Analysis of Two Classic TSP Variants.
Mark de BergKevin BuchinBart M. P. JansenGerhard J. WoegingerPublished in: ACM Trans. Algorithms (2021)
Keyphrases
- fine grained
- complexity analysis
- traveling salesman problem
- coarse grained
- theoretical analysis
- lower bound
- first order logic
- tightly coupled
- access control
- travelling salesman
- search space
- computational complexity
- genetic algorithm
- massively parallel
- optimal solution
- ant colony optimization
- combinatorial optimization
- optimization problems
- information retrieval
- databases