Approximation Algorithm for Bottleneck Steiner Tree Problem in the Euclidean Plane.
Zi-Mao LiDa-Ming ZhuShao-Han MaPublished in: J. Comput. Sci. Technol. (2004)
Keyphrases
- learning algorithm
- times faster
- experimental evaluation
- cost function
- preprocessing
- theoretical analysis
- expectation maximization
- detection algorithm
- optimization algorithm
- np hard
- objective function
- improved algorithm
- search space
- input data
- linear programming
- error bounds
- high accuracy
- worst case
- probabilistic model
- error tolerance
- computational complexity
- significant improvement
- k means
- approximation ratio
- euclidean plane
- ant colony optimization
- markov random field
- computational cost
- mobile robot
- dynamic programming
- similarity measure