An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane.
Lusheng WangZimao LiPublished in: Inf. Process. Lett. (2002)
Keyphrases
- times faster
- learning algorithm
- dynamic programming
- closed form
- np hard
- computational complexity
- significant improvement
- search space
- k means
- worst case
- error bounds
- preprocessing
- cost function
- segmentation algorithm
- randomized algorithm
- optimization algorithm
- neural network
- input data
- probabilistic model
- search algorithm
- objective function
- similarity measure
- genetic algorithm