On Approximation Lower Bounds for TSP with Bounded Metrics.
Marek KarpinskiRichard SchmiedPublished in: Electron. Colloquium Comput. Complex. (2012)
Keyphrases
- lower bound
- np hard
- upper bound
- optimal solution
- approximation algorithms
- traveling salesman problem
- linear programming relaxation
- polynomial approximation
- branch and bound
- continuous functions
- worst case
- min sum
- objective function
- constant factor
- integrality gap
- ant colony optimization
- closed form
- travelling salesman
- bayes error rate
- arbitrarily close
- randomized algorithm
- lower and upper bounds
- search space
- branch and bound algorithm
- approximation error
- genetic algorithm
- quadratic assignment problem
- approximation ratio
- lower bounding
- evaluation metrics
- approximation guarantees
- hypervolume indicator
- approximation schemes
- learning theory
- sample complexity
- linear program
- metaheuristic
- online learning
- satisfy the triangle inequality
- online algorithms
- upper and lower bounds