Computing a Minimum-Dilation Spanning Tree is NP-hard
Otfried CheongHerman J. HaverkortMira LeePublished in: CoRR (2007)
Keyphrases
- spanning tree
- minimum cost
- np hard
- edge disjoint
- minimum spanning tree
- approximation algorithms
- scheduling problem
- minimum weight
- minimum spanning trees
- special case
- np complete
- optimal solution
- undirected graph
- lower bound
- mathematical morphology
- computational complexity
- np hardness
- linear programming
- worst case
- knapsack problem
- binary images
- weighted graph
- greedy heuristic
- minimum total cost
- multimedia