Non-monotone submodular maximization under matroid and knapsack constraints
Jon LeeVahab S. MirrokniViswanath NagarajanMaxim SviridenkoPublished in: CoRR (2009)
Keyphrases
- submodular functions
- greedy algorithm
- objective function
- knapsack problem
- dynamic programming
- upper bound
- anti monotone
- real time
- feasible solution
- databases
- facility location problem
- greedy heuristic
- mixed integer
- global constraints
- constrained optimization
- combinatorial optimization
- integrity constraints
- high order
- constraint programming
- constraint satisfaction
- resource constraints
- linear constraints
- search space
- image segmentation
- decision trees
- genetic algorithm