A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree.
Hsueh-I LuR. RaviPublished in: ISPAN (1997)
Keyphrases
- spanning tree
- learning algorithm
- minimum spanning tree
- computational complexity
- k means
- detection algorithm
- optimal solution
- error bounds
- expectation maximization
- particle swarm optimization
- probabilistic model
- search space
- simulated annealing
- segmentation algorithm
- worst case
- dynamic programming
- approximation ratio
- minimum weight