Online bipartite matching with random arrivals
Authors:
Open Access
- 6 June 2011
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 597-606
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Online bipartite matching with unknown distributions2011
- Online Stochastic Matching: Beating 1-1/e2009
- On-line bipartite matching made simpleACM SIGACT News, 2008
- AdWords and generalized online matchingJournal of the ACM, 2007
- Allocating online advertisement space with unreliable estimates2007
- Approximation Algorithms for Metric Facility Location ProblemsSIAM Journal on Computing, 2006
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LPJournal of the ACM, 2003
- An optimal algorithm for on-line bipartite matching1990