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:
NeurIPS (2020)
Keyphrases
</>
objective function
upper bound
knapsack problem
greedy algorithm
dynamic programming
lower bound
worst case
multiscale
optimal solution
submodular functions
database
adaptive filtering
data driven
pairwise
image segmentation
case study
decision trees
search engine
learning algorithm
data mining