Fine-Grained Complexity Analysis of Two Classic TSP Variants.
Mark de BergKevin BuchinBart M. P. JansenGerhard J. WoegingerPublished in: CoRR (2016)
Keyphrases
- fine grained
- complexity analysis
- traveling salesman problem
- coarse grained
- theoretical analysis
- travelling salesman
- access control
- lower bound
- optimal solution
- massively parallel
- genetic algorithm
- computational complexity
- ant colony optimization
- search space
- optimization problems
- first order logic
- combinatorial optimization
- tightly coupled
- user intent
- expert systems
- artificial intelligence
- database