Approximation algorithms for stochastic and risk-averse optimization

We present improved approximation algorithms in stochastic optimization. We prove that the multi-stage stochastic versions of covering integer programs (such as set cover and vertex cover) admit essentially the same approximation algorithms as their standard (non-stochastic) counterparts; this improves upon work of Swamy & Shmoys that shows an approximability which depends multiplicatively on the number of stages. We also present approximation algorithms for facility location and some of its variants in the 2-stage recourse model, improving on previous approximation guarantees.

[1]  Martin E. Dyer,et al.  Computational complexity of stochastic programming problems , 2006, Math. Program..

[2]  Aravind Srinivasan,et al.  Improved Approximation Guarantees for Packing and Covering Integer Programs , 1999, SIAM J. Comput..

[3]  R. Ravi,et al.  What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization , 2005, APPROX-RANDOM.

[4]  Fabián A. Chudak,et al.  Improved Approximation Algorithms for the Uncapacitated Facility Location Problem , 2003, SIAM J. Comput..

[5]  C. Fortuin,et al.  Correlation inequalities on some partially ordered sets , 1971 .

[6]  A. Shapiro.  Monte Carlo Sampling Methods , 2003 .

[7]  R. Ravi,et al.  Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems , 2004, Math. Program..

[8]  Moses Charikar,et al.  Sampling Bounds for Stochastic Optimization , 2005, APPROX-RANDOM.

[9]  David B. Shmoys.  Approximation algorithms for clustering problems , 1999, COLT '99.

[10]  Jan Vondrák,et al.  Adaptivity and approximation for stochastic packing problems , 2005, SODA '05.

[11]  George B. Dantzig,et al.  Linear Programming Under Uncertainty , 2004, Manag. Sci..

[12]  Aravind Srinivasan,et al.  Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..

[13]  Mohammad Mahdian,et al.  Approximation Algorithms for Metric Facility Location Problems , 2006, SIAM J. Comput..

[14]  Evangelos Markakis,et al.  Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP , 2002, JACM.

[15]  Amin Saberi,et al.  A new greedy approach for facility location problems , 2002, STOC '02.

[16]  Maxim Sviridenko.  An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem , 2002, IPCO.

[17]  E. Beale.  ON MINIMIZING A CONVEX FUNCTION SUBJECT TO LINEAR INEQUALITIES , 1955 .

[18]  B DantzigGeorge.  Linear Programming Under Uncertainty , 1955 .

[19]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[20]  Nicole Immorlica,et al.  On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems , 2004, SODA '04.

[21]  Alexander Shapiro,et al.  On Complexity of Stochastic Programming Problems , 2005 .

[22]  Alexander Shapiro,et al.  The empirical behavior of sampling methods for stochastic programming , 2006, Ann. Oper. Res..

[23]  Jiawei Zhang,et al.  Approximation algorithms for facility location problems , 2004 .

[24]  Chaitanya Swamy,et al.  Approximation algorithms for 2-stage stochastic optimization problems , 2006, SIGA.

[25]  Chaitanya Swamy,et al.  Sampling-based approximation algorithms for multi-stage stochastic optimization , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[26]  Aravind Srinivasan,et al.  New approaches to covering and packing problems , 2001, SODA '01.

[27]  Mohit Singh,et al.  How to pay, come what may: approximation algorithms for demand-robust covering problems , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[28]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[29]  Chaitanya Swamy,et al.  An approximation scheme for stochastic linear programming and its application to stochastic integer programs , 2006, JACM.

[30]  Anthony Man-Cho So,et al.  Stochastic Combinatorial Optimization with Controllable Risk Aversion Level , 2006, APPROX-RANDOM.

[31]  Samir Khuller,et al.  Greedy strikes back: improved facility location algorithms , 1998, SODA '98.

[32]  R. Ravi,et al.  Boosted sampling: approximation algorithms for stochastic optimization , 2004, STOC '04.

[33]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[34]  Rolf H. Möhring,et al.  Approximation in stochastic scheduling: the power of LP-based priority policies , 1999, JACM.

[35]  Alexander Shapiro,et al.  The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study , 2003, Comput. Optim. Appl..

[36]  Jeffrey Scott Vitter,et al.  e-approximations with minimum packing constraint violation (extended abstract) , 1992, STOC '92.

[37]  R. Ravi,et al.  An edge in time saves nine: LP rounding approximation algorithms for stochastic network design , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[38]  David B. Shmoys,et al.  Approximation algorithms for facility location problems , 2000, APPROX.

[39]  Chaitanya SwamyDavid,et al.  Algorithms Column: Approximation Algorithms for 2-Stage Stochastic Optimization Problems , 2006 .

[40]  R. Wets,et al.  Stochastic programming , 1989 .

[41]  Moni Naor,et al.  Optimal File Sharing in Distributed Networks , 1995, SIAM J. Comput..

[42]  Jan Vondrák,et al.  Approximating the stochastic knapsack problem: the benefit of adaptivity , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.