Picture for Alberto Marchetti Spaccamela

Alberto Marchetti Spaccamela

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity

Add code
Feb 16, 2021
Figure 1 for Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
Figure 2 for Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
Viaarxiv icon