"Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack.
Grigory YaroslavtsevSamson ZhouDmitrii AvdiukhinPublished in: AISTATS (2020)
Keyphrases
- greedy algorithm
- knapsack problem
- dynamic programming
- greedy heuristic
- greedy algorithms
- submodular functions
- greedy strategy
- web applications
- easy to follow
- worst case
- optimal solution
- visual basic
- packing problem
- objective function
- reinforcement learning
- forward selection
- linear functions
- database
- provably near optimal
- approximation methods
- efficient computation
- linear programming
- search algorithm
- genetic algorithm