Sciweavers

Share
SIGACT
2008

On-line bipartite matching made simple

11 years 9 months ago
On-line bipartite matching made simple
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 this problem achieves a competitive ratio of 1 - 1/e.
Benjamin E. Birnbaum, Claire Mathieu
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2008
Where SIGACT
Authors Benjamin E. Birnbaum, Claire Mathieu
Comments (0)
books