A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs.
Paul S. BonsmaFlorian ZickfeldPublished in: WG (2008)
Keyphrases
- spanning tree
- minimum spanning tree
- times faster
- optimal solution
- learning algorithm
- detection algorithm
- dynamic programming
- edge disjoint
- search space
- closed form
- graph theory
- np hard
- objective function
- image segmentation
- segmentation algorithm
- adjacency graph
- polynomial time approximation
- randomized algorithm
- approximation ratio
- data structure
- graph structure
- computational complexity
- approximation algorithms
- graph matching
- error bounds
- high dimensional
- k means
- matching algorithm