Login / Signup
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint.
Georgios Amanatidis
Federico Fusco
Philip Lazos
Stefano Leonardi
Rebecca Reiffenhäuser
Published in:
CoRR (2020)
Keyphrases
</>
upper bound
objective function
knapsack problem
lower bound
dynamic programming
high order
greedy algorithm
packing problem
neural network
reinforcement learning
pairwise
cost function
linear programming
adaptive learning