Search Results for author: Devorah Kletenik

Found 2 papers, 0 papers with code

A Tight Bound for Stochastic Submodular Cover

no code implementations1 Feb 2021 Lisa Hellerstein, Devorah Kletenik, Srinivasan Parthasarathy

We show that the Adaptive Greedy algorithm of Golovin and Krause (2011) achieves an approximation bound of $(\ln (Q/\eta)+1)$ for Stochastic Submodular Cover: here $Q$ is the "goal value" and $\eta$ is the smallest non-zero marginal increase in utility deliverable by an item.

Scenario Submodular Cover

no code implementations10 Mar 2016 Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Patrick Lin

In contrast, in Stochastic Submodular Cover, the variables of the input distribution are assumed to be independent, and the distribution of each variable is given as input.

Cannot find the paper you are looking for? You can Submit a new open access paper.