Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost.
Christos KoufogiannakisNeal E. YoungPublished in: ICALP (1) (2009)
Keyphrases
- greedy algorithm
- optimal solution
- dynamic programming
- approximation ratio
- worst case
- cost function
- objective function
- matching algorithm
- computational cost
- np hard
- multiple constraints
- theoretical analysis
- closed form
- energy function
- approximation algorithms
- transportation problem
- optimization algorithm
- segmentation algorithm
- expectation maximization
- greedy algorithms
- k means
- search space
- preprocessing
- computational complexity
- locally optimal
- feature selection
- greedy strategy
- space complexity
- constraint programming
- clustering method
- simulated annealing
- significant improvement
- search algorithm
- decision trees