Fine-Grained Complexity Analysis of Two Classic TSP Variants.
Mark de BergKevin BuchinBart M. P. JansenGerhard J. WoegingerPublished in: ICALP (2016)
Keyphrases
- fine grained
- complexity analysis
- traveling salesman problem
- coarse grained
- travelling salesman
- theoretical analysis
- access control
- lower bound
- tightly coupled
- search space
- first order logic
- ant colony optimization
- combinatorial optimization
- massively parallel
- computational complexity
- genetic algorithm
- data lineage
- optimal solution
- search engine
- language model
- co occurrence