Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid.
Niv BuchbinderMoran FeldmanMohit GargPublished in: SIAM J. Comput. (2023)
Keyphrases
- submodular functions
- greedy algorithm
- approximation guarantees
- objective function
- randomized algorithm
- facility location problem
- energy function
- approximation ratio
- combinatorial optimization
- relaxation algorithm
- convex optimization
- approximation algorithms
- error bounds
- approximation methods
- relative error
- closed form
- min sum
- sample size
- lower bound
- constant factor approximation
- wavelet synopses
- posterior marginals
- learning algorithm
- convex functions
- high order
- theoretical analysis
- multiscale
- website