Login / Signup
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints.
Ariel Kulik
Hadas Shachnai
Tami Tamir
Published in:
Math. Oper. Res. (2013)
Keyphrases
</>
upper bound
objective function
knapsack problem
linear constraints
dynamic programming
constraint satisfaction
closed form
greedy algorithm
high order
data sets
data mining
optimal solution
higher order
optimization problems
constrained optimization