Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints.
Jon LeeVahab S. MirrokniViswanath NagarajanMaxim SviridenkoPublished in: SIAM J. Discret. Math. (2010)
Keyphrases
- submodular functions
- greedy algorithm
- facility location problem
- combinatorial optimization
- energy function
- objective function
- knapsack problem
- convex optimization
- diminishing returns
- upper bound
- dynamic programming
- constraint satisfaction
- learning problems
- constraint programming
- variational inequalities
- genetic algorithm
- graph cuts
- particle swarm optimization
- packing problem
- search algorithm