Upper bounds for minimum dilation triangulation in two special cases.
Sattar SattariMohammad IzadiPublished in: Inf. Process. Lett. (2018)
Keyphrases
- upper bound
- special case
- lower bound
- upper and lower bounds
- sample complexity
- constant factor
- worst case
- tight bounds
- lower and upper bounds
- sample size
- branch and bound
- range data
- computational complexity
- binary images
- upper bounding
- branch and bound algorithm
- delaunay triangulation
- np hard
- approximation algorithms
- genetic algorithm
- mathematical morphology
- spanning tree
- morphological operators
- minimum cost
- vc dimension
- linear programming
- permutation flowshop
- morphological filtering
- learning algorithm