New Inapproximability Bounds for TSP.
Marek KarpinskiMichael LampisRichard SchmiedPublished in: Electron. Colloquium Comput. Complex. (2013)
Keyphrases
- traveling salesman problem
- upper bound
- approximation algorithms
- travelling salesman
- lower bound
- worst case
- np hard
- optimal solution
- ant colony optimization
- genetic algorithm
- search space
- tight bounds
- upper and lower bounds
- data mining
- distribution free
- average case
- confidence bounds
- lower and upper bounds
- combinatorial optimization
- optimization problems
- similarity measure
- multiscale
- real world
- pac bayes