Sciweavers

90
Voted
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
14 years 10 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova