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