Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time.
Kai HanZongmai CaoShuang CuiBenwei WuPublished in: NeurIPS (2020)
Keyphrases
- greedy algorithm
- submodular functions
- approximation guarantees
- objective function
- worst case
- randomized algorithm
- approximation ratio
- energy function
- facility location problem
- approximation algorithms
- combinatorial optimization
- randomized algorithms
- high order
- relative error
- constant factor approximation
- approximation methods
- approximation error
- error bounds
- closed form
- dynamic programming
- convex optimization
- energy minimization
- upper bound
- linear functions
- approximation schemes
- min sum
- posterior marginals
- search space