"Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack.
Dmitrii AvdiukhinGrigory YaroslavtsevSamson ZhouPublished in: CoRR (2019)
Keyphrases
- greedy algorithm
- knapsack problem
- dynamic programming
- greedy heuristic
- greedy algorithms
- greedy strategy
- objective function
- submodular functions
- easy to follow
- web applications
- worst case
- feasible solution
- optimal solution
- search algorithm
- closed form
- linear functions
- provably near optimal
- upper bound
- np hard
- visual basic
- neural network
- high order
- optimization problems
- coverage includes
- decision trees
- feature selection