Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems

Danny Segev, Sahil Singla

In this paper, we propose a general framework to design {efficient} polynomial time approximation schemes (EPTAS) for fundamental stochastic combinatorial optimization problems. Gi…