Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints
Ariel KulikHadas ShachnaiTami TamirPublished in: CoRR (2011)
Keyphrases
- upper bound
- submodular functions
- anti monotone
- objective function
- greedy algorithm
- boolean functions
- constraint satisfaction
- knapsack problem
- efficient computation
- feasible solution
- uniform distribution
- cover inequalities
- real time
- constrained optimization
- constraint programming
- dynamic programming
- genetic algorithm
- data sets