Sign in
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint.
Georgios Amanatidis
Federico Fusco
Philip Lazos
Stefano Leonardi
Rebecca Reiffenhäuser
Published in:
J. Artif. Intell. Res. (2022)
Keyphrases
</>
constraint solving
constraint satisfaction problems
objective function
upper bound
dynamic programming
data driven
greedy algorithm
boolean functions
adaptive learning
data mining
information systems
knapsack problem
adaptive filtering
submodular functions