2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves.
Roberto Solis-ObaPublished in: ESA (1998)
Keyphrases
- spanning tree
- maximum number
- computational complexity
- preprocessing
- k means
- np hard
- dynamic programming
- learning algorithm
- minimum spanning tree
- approximation ratio
- worst case
- closed form
- upper bound
- error bounds
- combinatorial optimization
- segmentation algorithm
- search space
- optimal solution
- particle swarm optimization
- minimum weight
- undirected graph
- minimum cost
- detection algorithm
- probabilistic model
- objective function