Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time.
Kai HanZongmai CaoShuang CuiBenwei WuPublished in: CoRR (2020)
Keyphrases
- submodular functions
- greedy algorithm
- approximation guarantees
- objective function
- worst case
- randomized algorithm
- facility location problem
- energy function
- error bounds
- combinatorial optimization
- approximation ratio
- approximation algorithms
- relaxation algorithm
- randomized algorithms
- approximation error
- database
- energy minimization
- closed form
- markov random field
- approximation schemes
- posterior marginals
- approximation methods
- optimization problems
- computational complexity