Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?
Vladimir G. DeinekoAlexander TiskinPublished in: ACM J. Exp. Algorithmics (2009)
Keyphrases
- minimum weight
- spanning tree
- minimum spanning tree
- maximum weight
- traveling salesman problem
- tree patterns
- bipartite graph
- greedy heuristic
- weighted graph
- ant colony optimization
- tree structure
- optimal solution
- maximum cardinality
- genetic algorithm
- minimum cost
- metric space
- np hard
- undirected graph
- distance metric
- distance function
- optimization problems
- graph theory
- b tree
- greedy algorithm
- euclidean distance
- randomized algorithm
- search space