Computing a minimum-dilation spanning tree is NP-hard.
Otfried CheongHerman J. HaverkortMira LeePublished in: Comput. Geom. (2008)
Keyphrases
- spanning tree
- minimum cost
- np hard
- edge disjoint
- approximation algorithms
- minimum spanning tree
- minimum weight
- minimum spanning trees
- special case
- linear programming
- mathematical morphology
- minimum total cost
- optimal solution
- undirected graph
- knapsack problem
- lower bound
- scheduling problem
- np complete
- worst case
- np hardness
- genetic algorithm
- structuring elements
- leaf nodes
- image processing
- greedy heuristic
- morphological operators
- evolutionary algorithm