Stochastic Submodular Cover with Limited Adaptivity
暂无分享,去创建一个
[1] Yaron Singer,et al. The adaptive complexity of maximizing a submodular function , 2018, STOC.
[2] Eric Balkanski,et al. An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation , 2018, SODA.
[3] Huy L. Nguyen,et al. Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time , 2018, SODA.
[4] Sepehr Assadi,et al. Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem , 2018, SODA.
[5] Venkatesh Saligrama,et al. Comments on the Proof of Adaptive Stochastic Set Cover Based on Adaptive Submodularity and Its Implications for the Group Identification Problem in “Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations” , 2017, IEEE Transactions on Information Theory.
[6] Takanori Maehara,et al. Stochastic packing integer programs with few queries , 2017, Mathematical Programming.
[7] Arpit Agarwal,et al. Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons , 2017, COLT.
[8] Yang Li,et al. The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm , 2017, EC.
[9] Anupam Gupta,et al. Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions , 2016, SODA.
[10] Yang Li,et al. The Stochastic Matching Problem with (Very) Few Queries , 2016, EC.
[11] Viswanath Nagarajan,et al. Adaptive Submodular Ranking , 2016, IPCO.
[12] S. Matthew Weinberg,et al. Parallel algorithms for select and partition with noisy comparisons , 2016, STOC.
[13] Lisa Hellerstein,et al. Scenario Submodular Cover , 2016, WAOA.
[14] Amit Chakrabarti,et al. Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover , 2015, SODA.
[15] Vianney Perchet,et al. Batched Bandit Problems , 2015, COLT.
[16] Lisa Hellerstein,et al. Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline , 2015, CIAC.
[17] Piotr Sankowski,et al. Stochastic Query Covering for Fast Approximate Document Retrieval , 2015, TOIS.
[18] David Kempe,et al. Deterministic and probabilistic binary search in graphs , 2015, STOC.
[19] Ariel D. Procaccia,et al. Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries , 2014, EC.
[20] David Steurer,et al. Analytical approach to parallel repetition , 2013, STOC.
[21] Lisa Hellerstein,et al. Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover , 2013, SODA.
[22] Dana Moshkovitz,et al. The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover , 2012, Theory Comput..
[23] Viswanath Nagarajan,et al. Minimum Latency Submodular Cover , 2011, ICALP.
[24] Graham Cormode,et al. Set cover algorithms for very large datasets , 2010, CIKM.
[25] Yossi Azar,et al. Ranking with submodular valuations , 2010, SODA '11.
[26] Andreas Krause,et al. Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization , 2010, COLT 2010.
[27] Alexander Shapiro,et al. Lectures on Stochastic Programming: Modeling and Theory , 2009 .
[28] Hamid Nazerzadeh,et al. Maximizing Stochastic Monotone Submodular Functions , 2009, Manag. Sci..
[29] Yossi Azar,et al. Multiple intents re-ranking , 2009, STOC '09.
[30] Amin Saberi,et al. Stochastic Submodular Maximization , 2008, WINE.
[31] Hao Yang,et al. Near-optimal algorithms for shared filter evaluation in data stream systems , 2008, SIGMOD Conference.
[32] Aravind Srinivasan,et al. Approximation algorithms for stochastic and risk-averse optimization , 2007, SODA '07.
[33] Jan Vondrák,et al. Stochastic Covering and Adaptivity , 2006, LATIN.
[34] 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).
[35] Moses Charikar,et al. Sampling Bounds for Stochastic Optimization , 2005, APPROX-RANDOM.
[36] Jan Vondrák,et al. Adaptivity and approximation for stochastic packing problems , 2005, SODA '05.
[37] Chaitanya Swamy,et al. Stochastic optimization is (almost) as easy as deterministic optimization , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[38] Jan Vondrák,et al. Approximating the stochastic knapsack problem: the benefit of adaptivity , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[39] U. Feige. A threshold of ln n for approximating set cover (preliminary version) , 1996, STOC '96.
[40] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.
[41] Richard Cole,et al. Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[42] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[43] Leslie G. Valiant,et al. Parallelism in Comparison Problems , 1975, SIAM J. Comput..
[44] Laurence A. Wolsey,et al. An analysis of the greedy algorithm for the submodular set covering problem , 1982, Comb..