Stochastic Covering and Adaptivity

@inproceedings{Goemans2006StochasticCA,
  title={Stochastic Covering and Adaptivity},
  author={Michel X. Goemans and Jan Vondr{\'a}k},
  booktitle={LATIN},
  year={2006}
}
We introduce a class of “stochastic covering” problems where the target set X to be covered is fixed, while the “items” used in the covering are characterized by probability distributions over subsets of X. This is a natural counterpart to the stochastic packing problems introduced in [5]. In analogy to [5], we study both adaptive and non-adaptive strategies to find a feasible solution, and in particular the adaptivity gap, introduced in [4]. It turns out that in contrast to deterministic… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

Minimum Latency Submodular Cover

ACM Trans. Algorithms • 2016
View 5 Excerpts
Highly Influenced

Ignorant vs. Anonymous Recommendations

ESA 2015 • 2015
View 4 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Stochastic optimization is (almost) as easy as deterministic optimization

45th Annual IEEE Symposium on Foundations of Computer Science • 2004
View 2 Excerpts