Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio.
Vladimir G. DeinekoAlexander TiskinPublished in: Electron. Notes Discret. Math. (2009)
Keyphrases
- approximation ratio
- np hard
- approximation algorithms
- tree traversal
- greedy algorithm
- special case
- traveling salesman problem
- tree structure
- search algorithm
- upper bound
- optimal solution
- approximately optimal
- metric space
- travelling salesman
- greedy algorithms
- tree construction
- ant colony optimization
- minimum cost
- tree structures
- lower bound
- b tree
- distance measure
- evaluation metrics
- spanning tree
- similarity metric
- weighting scheme
- knapsack problem
- optimization problems
- computational complexity
- combinatorial optimization
- hierarchical structure