An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem
A. Karim Abu-AffashPublished in: CoRR (2010)
Keyphrases
- detection algorithm
- high accuracy
- k means
- times faster
- learning algorithm
- experimental evaluation
- dynamic programming
- improved algorithm
- np hard
- cost function
- significant improvement
- preprocessing
- computational complexity
- convergence rate
- optimal solution
- error bounds
- neural network
- particle swarm optimization
- computationally efficient
- theoretical analysis
- data sets
- matching algorithm
- tree structure
- clustering method
- image sequences
- objective function
- probabilistic model
- data structure
- special case