Fast Approximation Algorithm for Restricted Euclidean Bottleneck Steiner Tree Problem.
Zimao LiWenying XiaoPublished in: J. Multim. (2014)
Keyphrases
- dynamic programming
- learning algorithm
- optimal solution
- times faster
- matching algorithm
- search space
- experimental evaluation
- objective function
- optimization algorithm
- theoretical analysis
- cost function
- computational cost
- high accuracy
- detection algorithm
- segmentation algorithm
- k means
- preprocessing
- computational complexity
- genetic algorithm
- simulated annealing
- particle swarm optimization
- multi objective
- significant improvement
- distance function
- data structure
- greedy algorithm
- convergence rate
- recognition algorithm
- improved algorithm
- steiner tree