-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost.
Christos KoufogiannakisNeal E. YoungPublished in: Algorithmica (2013)
Keyphrases
- objective function
- times faster
- cost function
- computational cost
- detection algorithm
- preprocessing
- optimization algorithm
- k means
- closed form
- worst case
- significant improvement
- computational complexity
- learning algorithm
- constrained optimization
- recognition algorithm
- np hard
- probabilistic model
- convergence rate
- theoretical analysis
- error bounds
- error tolerance
- energy minimization
- multiple constraints
- matching algorithm
- energy function
- segmentation algorithm
- expectation maximization
- linear programming
- experimental evaluation
- dynamic programming
- search space
- data structure