An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane.
Naveen GargDorit S. HochbaumPublished in: STOC (1994)
Keyphrases
- learning algorithm
- computationally efficient
- computational cost
- dynamic programming
- np hard
- preprocessing
- computational complexity
- k means
- times faster
- approximation ratio
- experimental evaluation
- improved algorithm
- genetic algorithm
- matching algorithm
- segmentation algorithm
- simulated annealing
- similarity measure
- significant improvement
- optimal solution
- digital plane
- convergence rate
- parametric curves
- convex hull
- closed form
- detection algorithm
- theoretical analysis
- expectation maximization
- worst case
- cost function
- three dimensional
- decision trees