Login / Signup
Maximizing a Submodular Function with Bounded Curvature Under an Unknown Knapsack Constraint.
Max Klimm
Martin Knaack
Published in:
APPROX/RANDOM (2022)
Keyphrases
</>
submodular functions
greedy algorithm
knapsack problem
facility location problem
dynamic programming
combinatorial optimization
multiscale
energy function
machine learning
objective function
optimal solution
upper bound
feasible solution