Sciweavers

80
Voted
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 2 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál