Selling Tomorrow's Bargains Today
暂无分享,去创建一个
Aravind Srinivasan | Mohammad Taghi Hajiaghayi | Hossein Esfandiari | Melika Abolhassani | Hamid Mahini | David L. Malec
[1] R. Ravi,et al. Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems , 2011, SIAM J. Comput..
[2] 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).
[3] Lisa Fleischer,et al. Submodular Approximation: Sampling-based Algorithms and Lower Bounds , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[4] U. Feige,et al. Maximizing Non-monotone Submodular Functions , 2011 .
[5] Éva Tardos,et al. Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..
[6] Rajiv Gandhi,et al. Dependent rounding and its applications to approximation algorithms , 2006, JACM.
[7] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[8] R. Ravi,et al. When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.
[9] David S. Johnson,et al. The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.
[10] Mohammad Taghi Hajiaghayi,et al. Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[11] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[12] Joseph Naor,et al. Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract) , 2011, ICALP.
[13] Jan Vondrák,et al. Submodular maximization by simulated annealing , 2010, SODA '11.
[14] Jan Vondr. Symmetry and Approximability of Submodular Maximization Problems , 2013 .
[15] Nicole Immorlica,et al. On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems , 2004, SODA '04.
[16] Vahab Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2007, FOCS 2007.
[17] Elchanan Mossel,et al. Submodularity of Influence in Social Networks: From Local to Global , 2010, SIAM J. Comput..
[18] Joseph Naor,et al. A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization , 2015, SIAM J. Comput..
[19] Alexander Shapiro,et al. The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..
[20] R. Ravi,et al. When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..
[21] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[22] Eli Upfal,et al. Commitment under uncertainty: Two-stage stochastic matching problems , 2007, Theor. Comput. Sci..
[23] Moses Charikar,et al. Sampling Bounds for Stochastic Optimization , 2005, APPROX-RANDOM.
[24] A. Frieze,et al. On the random 2-stage minimum spanning tree , 2006 .
[25] Chaitanya Swamy,et al. Stochastic optimization is (almost) as easy as deterministic optimization , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[26] 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).
[27] Andrew J. Schaefer,et al. A factor 1/2 approximation algorithm for two-stage stochastic matching problems , 2006, Eur. J. Oper. Res..