On Approximation Lower Bounds for TSP with Bounded Metrics
Marek KarpinskiRichard SchmiedPublished in: CoRR (2012)
Keyphrases
- lower bound
- np hard
- traveling salesman problem
- upper bound
- optimal solution
- approximation algorithms
- continuous functions
- travelling salesman
- min sum
- branch and bound
- linear programming relaxation
- branch and bound algorithm
- integrality gap
- arbitrarily close
- randomized algorithm
- heuristic solution
- hypervolume indicator
- approximation error
- optimal cost
- objective function
- bayes error rate
- search space
- optimization problems
- closed form
- constant factor
- approximation guarantees
- polynomial approximation
- lower bounding
- approximation ratio
- upper and lower bounds
- error bounds
- genetic algorithm
- approximation schemes
- lower and upper bounds
- worst case