Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
Vladimir G. DeinekoAlexandre TiskinPublished in: CoRR (2007)
Keyphrases
- minimum weight
- approximation ratio
- spanning tree
- np hard
- minimum spanning tree
- minimum cost
- maximum weight
- traveling salesman problem
- greedy heuristic
- approximation algorithms
- tree patterns
- greedy algorithm
- bipartite graph
- special case
- maximum cardinality
- search algorithm
- ant colony optimization
- upper bound
- weighted graph
- randomized algorithm
- tree structure
- optimal solution
- combinatorial optimization
- genetic algorithm
- distance metric
- search space
- lower bound
- graph theory
- distance measure
- structural features
- social networks
- multiscale
- knapsack problem
- undirected graph
- scheduling problem
- shortest path
- multi class
- optimization problems