An optimal algorithm for the Euclidean bottleneck full Steiner tree problem.
Ahmad BiniazAnil MaheshwariMichiel H. M. SmidPublished in: Comput. Geom. (2014)
Keyphrases
- dynamic programming
- learning algorithm
- optimal solution
- worst case
- detection algorithm
- experimental evaluation
- times faster
- objective function
- np hard
- globally optimal
- recognition algorithm
- matching algorithm
- locally optimal
- square root
- significant improvement
- preprocessing
- optimization algorithm
- euclidean distance
- segmentation algorithm
- path planning
- computationally efficient
- convergence rate
- simulated annealing
- computational cost
- optimal path