Revisiting the Approximation Bound for Stochastic Submodular Cover.
Lisa HellersteinDevorah KletenikPublished in: J. Artif. Intell. Res. (2018)
Keyphrases
- error bounds
- discrete random variables
- approximation schemes
- greedy algorithm
- stage stochastic programs
- monte carlo sampling
- randomized algorithm
- worst case
- relative error
- approximation algorithms
- closed form
- upper bound
- lower bound
- stochastic model
- stochastic optimization
- worst case analysis
- submodular functions
- monte carlo
- approximation error
- approximation methods
- constant factor
- regret bounds
- stochastic nature
- queueing networks
- high order
- markov chain
- higher order
- energy minimization