"Bring Your Own Greedy"+Max: Near-Optimal $1/2$-Approximations for Submodular Knapsack

Add code
Oct 12, 2019
Figure 1 for "Bring Your Own Greedy"+Max: Near-Optimal $1/2$-Approximations for Submodular Knapsack
Figure 2 for "Bring Your Own Greedy"+Max: Near-Optimal $1/2$-Approximations for Submodular Knapsack
Figure 3 for "Bring Your Own Greedy"+Max: Near-Optimal $1/2$-Approximations for Submodular Knapsack
Figure 4 for "Bring Your Own Greedy"+Max: Near-Optimal $1/2$-Approximations for Submodular Knapsack

Share this with someone who'll enjoy it:

View paper onarxiv icon

Share this with someone who'll enjoy it: