Stochastic Submodular Cover with Limited Adaptivity
SODA '19: Symposium on Discrete Algorithms San Diego California January, 2019, pp. 323-342, 2019.
In the submodular cover problem, we are given a non-negative monotone submodular function f over a ground set E of items, and the goal is to choose a smallest subset S ⊆ E such that f (S) = Q where Q = f (E). In the stochastic version of the problem, we are given m stochastic items which are different random variables that independently r...More
Full Text (Upload PDF)
PPT (Upload PPT)