Login / Signup
Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint.
Max Klimm
Martin Knaack
Published in:
CoRR (2022)
Keyphrases
</>
submodular functions
greedy algorithm
knapsack problem
dynamic programming
facility location problem
combinatorial optimization
energy function
packing problem
machine learning
higher order
feasible solution
convex optimization