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

Share this with someone who'll enjoy it:

View paper onarxiv icon

Share this with someone who'll enjoy it: