Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time.
Chandra ChekuriKent QuanrudPublished in: CoRR (2017)
Keyphrases
- worst case
- traveling salesman problem
- upper bound
- lower bound
- combinatorial optimization
- np hard
- ant colony optimization
- error bounds
- similarity metric
- fisher information
- metric learning
- invited talk
- travelling salesman
- genetic algorithm
- artificial intelligence
- optimization problems
- search space
- metric space
- triangle inequality
- satisfy the triangle inequality
- quality metrics
- knapsack problem
- distance metric
- euclidean distance
- distance function
- image quality
- distance measure
- data structure
- objective function