Minimum Weight Euclidean t-spanner is NP-Hard
Paz CarmiLilach Chaitman-YerushalmiPublished in: CoRR (2012)
Keyphrases
- minimum weight
- greedy heuristic
- np hard
- maximum weight
- spanning tree
- bipartite graph
- greedy algorithm
- optimal solution
- minimum cost
- knapsack problem
- graph theory
- maximum cardinality
- euclidean space
- lower bound
- scheduling problem
- weighted graph
- special case
- minimum spanning tree
- euclidean distance
- graphical models
- approximation algorithms
- dynamic programming
- decision problems
- worst case
- upper bound
- relational databases
- objective function
- multiscale