SIGACT
2008
13 years 11 months ago
2008
We examine the classic on-line bipartite matching problem studied by Karp, Vazirani, and Vazirani [8] and provide a simple proof of their result that the Ranking algorithm for thi...
FOCS
2005
IEEE
14 years 5 months ago
2005
IEEE
How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching p...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...