A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves.
Roberto Solis-ObaPaul S. BonsmaStefanie LowskiPublished in: Algorithmica (2017)
Keyphrases
- spanning tree
- maximum number
- minimum spanning tree
- objective function
- detection algorithm
- search space
- preprocessing
- np hard
- closed form
- data structure
- particle swarm optimization
- computational complexity
- error bounds
- optimal solution
- learning algorithm
- dynamic programming
- tree structure
- randomized algorithm
- minimum weight
- edge disjoint