Traveling Salesman Cycles are not Always Subgraphs of Delaunay Triangulations or of Minimum Weight Triangulations.
Michael B. DillencourtPublished in: Inf. Process. Lett. (1987)
Keyphrases
- traveling salesman
- minimum weight
- delaunay triangulations
- bipartite graph
- traveling salesman problem
- delaunay triangulation
- quadratic assignment problem
- spanning tree
- greedy heuristic
- weighted graph
- minimum spanning tree
- persistent homology
- global optimization
- data structure
- randomized algorithm
- greedy algorithm
- tree patterns
- topological features
- database
- knapsack problem
- neural network