A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem.
Naveen GargGoran KonjevodR. RaviPublished in: J. Algorithms (2000)
Keyphrases
- experimental evaluation
- improved algorithm
- dynamic programming
- times faster
- computational complexity
- detection algorithm
- significant improvement
- np hard
- search space
- k means
- expectation maximization
- computationally efficient
- cost function
- data sets
- closed form
- error bounds
- recognition algorithm
- optimization algorithm
- learning algorithm
- worst case
- denoising
- preprocessing
- search algorithm
- optimal solution
- objective function
- convergence rate
- image sequences
- feature selection
- prize collecting