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.

• Type: Journal
• Year: 2008
• Where: SIGACT
• Authors: Benjamin E. Birnbaum, Claire Mathieu
• Keywords: Bipartite Matching Problem, SIGACT 2008, Simple Proof, Vazirani