An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane.
Naveen GargDorit S. HochbaumPublished in: Algorithmica (1997)
Keyphrases
- high accuracy
- dynamic programming
- learning algorithm
- improved algorithm
- objective function
- optimization algorithm
- simulated annealing
- detection algorithm
- theoretical analysis
- similarity measure
- experimental evaluation
- np hard
- preprocessing
- times faster
- computational complexity
- multi objective
- approximation ratio
- error bounds
- segmentation algorithm
- expectation maximization
- cost function
- linear programming
- matching algorithm
- neural network
- mobile robot
- optimal solution
- minimum spanning tree
- feature selection