New inapproximability bounds for TSP.
Marek KarpinskiMichael LampisRichard SchmiedPublished in: J. Comput. Syst. Sci. (2015)
Keyphrases
- traveling salesman problem
- upper bound
- approximation algorithms
- lower bound
- upper and lower bounds
- travelling salesman
- np hard
- genetic algorithm
- error bounds
- search space
- optimization problems
- ant colony optimization
- optimal solution
- worst case
- vc dimension
- combinatorial optimization
- lower and upper bounds
- tight bounds
- database
- worst case bounds
- multi class
- training set
- social networks
- real world
- real time