On-line bipartite matching made simple

Open Webpage

Benjamin E. Birnbaum, Claire Mathieu

Published: 01 Jan 2008, Last Modified: 08 Aug 2024SIGACT News 2008EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: 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.