Online submodular maximization: beating 1/2 made simple
暂无分享,去创建一个
[1] Bala Kalyanasundaram,et al. An optimal deterministic algorithm for online b-matching , 1996, Theor. Comput. Sci..
[2] Yuval Filmus,et al. Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search , 2012, SIAM J. Comput..
[3] Aranyak Mehta,et al. Online bipartite matching with unknown distributions , 2011, STOC '11.
[4] SaberiAmin,et al. AdWords and generalized online matching , 2007 .
[5] Amin Saberi,et al. Online stochastic matching: online actions based on offline statistics , 2010, SODA '11.
[6] Jan Vondrák,et al. Fast algorithms for maximizing submodular functions , 2014, SODA.
[7] Gagan Goel,et al. Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations , 2010, SODA.
[8] Nikhil R. Devanur,et al. Asymptotically optimal algorithm for stochastic adwords , 2012, EC '12.
[9] Jon Feldman,et al. Online Ad Assignment with Free Disposal , 2009, WINE.
[10] Aranyak Mehta,et al. Online Stochastic Matching: Beating 1-1/e , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[11] Niv Buchbinder,et al. Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid , 2019, SODA.
[12] Thomas P. Hayes,et al. The adwords problem: online keyword matching with budgeted bidders under random permutations , 2009, EC '09.
[13] Uriel Feige,et al. The Submodular Welfare Problem with Demand Queries , 2010, Theory Comput..
[14] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[15] Roy Schwartz,et al. Comparing Apples and Oranges: Query Trade-off in Submodular Maximization , 2017, Math. Oper. Res..
[16] Richard M. Karp,et al. An optimal algorithm for on-line bipartite matching , 1990, STOC '90.
[17] Aranyak Mehta,et al. Online budgeted matching in random input models with applications to Adwords , 2008, SODA '08.
[18] Claire Mathieu,et al. Maximum Matching in Semi-streaming with Few Passes , 2011, APPROX-RANDOM.
[19] Morteza Zadimoghaddam,et al. Online Stochastic Weighted Matching: Improved Approximation Algorithms , 2011, WINE.
[20] Joseph Naor,et al. A Unified Continuous Greedy Algorithm for Submodular Maximization , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[21] Sahil Singla,et al. Online Matroid Intersection: Beating Half for Random Arrival , 2017, IPCO.
[22] Vahab S. Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2011, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[23] Joseph Naor,et al. Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.
[24] Morteza Zadimoghaddam,et al. Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order , 2015, STOC.
[25] Aranyak Mehta,et al. Online Matching and Ad Allocation , 2013, Found. Trends Theor. Comput. Sci..
[26] Ola Svensson,et al. Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams , 2018, ICML.
[27] Morteza Zadimoghaddam,et al. Online Weighted Matching: Beating the 1/2 Barrier , 2017, ArXiv.
[28] Andreas Krause,et al. Lazier Than Lazy Greedy , 2014, AAAI.
[29] Jan Vondrák,et al. Online Submodular Welfare Maximization: Greedy is Optimal , 2012, SODA.
[30] Mohammad Taghi Hajiaghayi,et al. Online prophet-inequality matching with applications to ad allocation , 2012, EC '12.
[31] Nikhil R. Devanur,et al. Near optimal online algorithms and fast approximation algorithms for resource allocation problems , 2011, EC '11.
[32] Vahab S. Mirrokni,et al. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions , 2008, EC '08.
[33] Jan Vondrák,et al. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..
[34] Mohammad Mahdian,et al. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs , 2011, STOC '11.