A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs.
Paul S. BonsmaFlorian ZickfeldPublished in: SIAM J. Discret. Math. (2011)
Keyphrases
- spanning tree
- minimum spanning tree
- computational complexity
- learning algorithm
- times faster
- edge disjoint
- undirected graph
- dynamic programming
- worst case
- optimal solution
- detection algorithm
- np hard
- k means
- matching algorithm
- minimum weight
- combinatorial optimization
- approximation ratio
- graph structure
- adjacency graph
- special case
- edge weights
- probabilistic model
- graph theory
- approximation algorithms
- simulated annealing
- closed form
- ant colony optimization