New Inapproximability Bounds for TSP.
Marek KarpinskiMichael LampisRichard SchmiedPublished in: ISAAC (2013)
Keyphrases
- traveling salesman problem
- upper bound
- lower bound
- approximation algorithms
- travelling salesman
- worst case
- lower and upper bounds
- search space
- ant colony optimization
- error bounds
- genetic algorithm
- upper and lower bounds
- search algorithm
- optimization problems
- np hard
- combinatorial optimization
- cost function
- training set
- sample complexity
- vc dimension
- optimal solution
- computer vision
- data sets
- tight bounds