TY - CONF T1 - Approximation algorithms for stochastic and risk-averse optimization T2 - Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms Y1 - 2007 A1 - Srinivasan, Aravind AB - 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. JA - Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms T3 - SODA '07 PB - Society for Industrial and Applied Mathematics CY - Philadelphia, PA, USA SN - 978-0-898716-24-5 UR - http://dl.acm.org/citation.cfm?id=1283383.1283523 ER -