64 citations · 323 across the 25 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013
Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover
Amol Deshpande, Lisa Hellerstein, Devorah Kletenik
Stochastic Boolean Function Evaluation is the problem of determining the value of a given Boolean function f on an unknown input x, when each bit of x_i of x can only be determined…
cs.DS2010★ 23 cited
Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
Jian Li, Amol Deshpande
We study the stochastic versions of a broad class of combinatorial problems where the weights of the elements in the input dataset are uncertain. The class of problems that we stud…