An approximation algorithm for the maximum leaf spanning arborescence problem.
Matthew DrescherAdrian VettaPublished in: ACM Trans. Algorithms (2010)
Keyphrases
- preprocessing
- learning algorithm
- optimization algorithm
- k means
- worst case
- optimal solution
- computational complexity
- objective function
- approximation ratio
- np hard
- dynamic programming
- error bounds
- high accuracy
- cost function
- error tolerance
- convergence rate
- times faster
- absolute error
- theoretical analysis
- computational cost
- experimental evaluation
- significant improvement
- segmentation algorithm
- expectation maximization
- ant colony optimization
- particle swarm optimization
- improved algorithm
- spanning tree
- data structure
- maximum error
- similarity measure