A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint.
Ariel KulikRoy SchwartzHadas ShachnaiPublished in: CoRR (2021)
Keyphrases
- upper bound
- objective function
- lower bound
- knapsack problem
- greedy algorithm
- dynamic programming
- conjugate gradient algorithm
- worst case
- approximation error
- optimal solution
- optimization problems
- feasible solution
- error bounds
- approximation algorithms
- memory efficient
- energy minimization
- highly efficient
- packing problem
- linear constraints
- high order
- approximation methods
- submodular functions
- generalization error bounds
- posterior marginals
- constant factor approximation