Computing Geometric Minimum-Dilation Graphs is NP-Hard.
Panos GiannopoulosRolf KleinChristian KnauerMartin KutzDániel MarxPublished in: Int. J. Comput. Geom. Appl. (2010)
Keyphrases
- np hard
- minimum cost
- special case
- approximation algorithms
- spanning tree
- mathematical morphology
- graph theoretical
- optimal solution
- integer programming
- directed graph
- binary images
- knapsack problem
- approximation guarantees
- linear programming
- geometric structure
- lower bound
- set cover
- computationally hard
- greedy approximation algorithm
- np hardness
- graph theoretic
- graph mining
- closely related
- np complete
- computational complexity