On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees.
Gautam DasSanjiv KapoorMichiel H. M. SmidPublished in: Algorithmica (1997)
Keyphrases
- traveling salesman
- minimum spanning trees
- traveling salesman problem
- minimum spanning tree
- combinatorial optimization
- worst case
- global optimization
- spanning tree
- computational complexity
- neighborhood graph
- genetic algorithm
- k nearest neighbor
- euclidean distance
- machine learning
- feature space
- euclidean space
- feature selection