An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs.
Jing HeHongyu LiangPublished in: COCOA (2) (2010)
Keyphrases
- learning algorithm
- dynamic programming
- k means
- significant improvement
- preprocessing
- cost function
- probabilistic model
- worst case
- expectation maximization
- theoretical analysis
- detection algorithm
- error bounds
- optimal solution
- approximation ratio
- tree structure
- computational cost
- computational complexity
- optimization algorithm
- convergence rate
- recognition algorithm
- graph structure
- graph clustering
- polygonal approximation
- randomized algorithm
- error tolerance