暂无分享,去创建一个
[1] Richard M. Karp,et al. An optimal algorithm for on-line bipartite matching , 1990, STOC '90.
[2] P. Orlik,et al. Arrangements Of Hyperplanes , 1992 .
[3] Amin Saberi,et al. Online stochastic matching: online actions based on offline statistics , 2010, SODA '11.
[4] Nicole Immorlica,et al. Online auctions and generalized secretary problems , 2008, SECO.
[5] Aranyak Mehta,et al. Online Stochastic Matching: Beating 1-1/e , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[6] Gagan Goel,et al. Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations , 2010, SODA.
[7] Morteza Zadimoghaddam,et al. Simultaneous approximations for adversarial and stochastic online budgeted allocation , 2012, SODA.
[8] Zizhuo Wang,et al. A Dynamic Near-Optimal Algorithm for Online Linear Programming , 2009, Oper. Res..
[9] Jon Feldman,et al. Online Stochastic Packing Applied to Display Ad Allocation , 2010, ESA.
[10] Joseph Naor,et al. Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.
[11] Aranyak Mehta,et al. Online bipartite matching with unknown distributions , 2011, STOC '11.
[12] Aranyak Mehta,et al. AdWords and Generalized On-line Matching , 2005, FOCS.
[13] Mohammad Mahdian,et al. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs , 2011, STOC '11.
[14] Thomas P. Hayes,et al. The adwords problem: online keyword matching with budgeted bidders under random permutations , 2009, EC '09.
[15] Aranyak Mehta,et al. Online budgeted matching in random input models with applications to Adwords , 2008, SODA '08.
[16] Patrick Jaillet,et al. Online Stochastic Matching: New Algorithms with Better Bounds , 2014, Math. Oper. Res..