Improved Bounds in Stochastic Matching and Optimization
暂无分享,去创建一个
Aravind Srinivasan | Pan Xu | Amit Chavan | Alok Baveja | Andrei Nikiforov | A. Srinivasan | Amit Chavan | A. Baveja | Pan Xu | Andrei Nikiforov | Alok Baveja
[1] 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.
[2] J Figueira,et al. Stochastic Programming , 1998, J. Oper. Res. Soc..
[3] R. Wets,et al. Stochastic programming , 1989 .
[4] John M. Wilson,et al. Introduction to Stochastic Programming , 1998, J. Oper. Res. Soc..
[5] Tommy R. Jensen,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .
[6] Zoltán Füredi,et al. On the fractional matching polytope of a hypergraph , 1993, Comb..
[7] Nicole Immorlica,et al. On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems , 2004, SODA '04.
[8] Thomas Ottmann. Automata, Languages and Programming , 1987, Lecture Notes in Computer Science.
[9] A. Ruszczynski. Stochastic Programming Models , 2003 .
[10] Fabrizio Grandoni,et al. Improved Approximation Algorithms for Stochastic Matching , 2015, ESA.
[11] Rajiv Gandhi,et al. Dependent rounding and its applications to approximation algorithms , 2006, JACM.
[12] Moses Charikar,et al. Sampling Bounds for Stochastic Optimization , 2005, APPROX-RANDOM.
[13] Alexander Shapiro,et al. The empirical behavior of sampling methods for stochastic programming , 2006, Ann. Oper. Res..
[14] Amit Kumar,et al. A constant-factor approximation for stochastic Steiner forest , 2009, STOC '09.
[15] Atri Rudra,et al. When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings , 2010, Algorithmica.
[16] Alexander Shapiro,et al. Lectures on Stochastic Programming - Modeling and Theory, Second Edition , 2014, MOS-SIAM Series on Optimization.
[17] Atri Rudra,et al. Approximating Matches Made in Heaven , 2009, ICALP.
[18] Atri Rudra,et al. When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings , 2010, ArXiv.
[19] David P. Williamson,et al. The Design of Approximation Algorithms , 2011 .
[20] Chaitanya Swamy,et al. An approximation scheme for stochastic linear programming and its application to stochastic integer programs , 2006, JACM.
[21] Piotr Sankowski,et al. Stochastic analyses for online combinatorial optimization problems , 2008, SODA '08.
[22] E. Beale. ON MINIMIZING A CONVEX FUNCTION SUBJECT TO LINEAR INEQUALITIES , 1955 .
[23] Aravind Srinivasan,et al. Selling Tomorrow's Bargains Today , 2015, AAMAS.
[24] David B. Shmoys,et al. Approximation Algorithms for Stochastic Inventory Control Models , 2005, Math. Oper. Res..
[25] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[26] Jan Vondrák,et al. Approximating the stochastic knapsack problem: the benefit of adaptivity , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[27] Alexander Shapiro,et al. Lectures on Stochastic Programming: Modeling and Theory , 2009 .
[28] Alexander Shapiro,et al. The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..
[29] A. Shapiro. Monte Carlo Sampling Methods , 2003 .
[30] George B. Dantzig,et al. Linear Programming Under Uncertainty , 2004, Manag. Sci..
[31] Aravind Srinivasan,et al. Approximation algorithms for stochastic and risk-averse optimization , 2007, SODA '07.
[32] Aravind Srinivasan,et al. Finding Large Independent Sets in Graphs and Hypergraphs , 2005, SIAM J. Discret. Math..
[33] C. Fortuin,et al. Correlation inequalities on some partially ordered sets , 1971 .
[34] R. Ravi,et al. Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems , 2004, Math. Program..