Minimum weight Euclidean t-spanner is NP-hard.
Paz CarmiLilach Chaitman-YerushalmiPublished in: J. Discrete Algorithms (2013)
Keyphrases
- minimum weight
- greedy heuristic
- np hard
- maximum weight
- spanning tree
- bipartite graph
- greedy algorithm
- optimal solution
- graph theory
- minimum cost
- minimum spanning tree
- knapsack problem
- euclidean space
- weighted graph
- euclidean distance
- scheduling problem
- special case
- maximum cardinality
- approximation algorithms
- lower bound
- computational complexity
- multiscale
- random walk
- upper bound
- randomized algorithm