Non-monotone submodular maximization under matroid and knapsack constraints.
Jon LeeVahab S. MirrokniViswanath NagarajanMaxim SviridenkoPublished in: STOC (2009)
Keyphrases
- submodular functions
- greedy algorithm
- objective function
- upper bound
- dynamic programming
- facility location problem
- constraint programming
- knapsack problem
- cover inequalities
- anti monotone
- constrained optimization
- boolean functions
- optimal solution
- reinforcement learning
- constraint satisfaction
- high order
- resource constraints
- energy function
- case study