Sciweavers

2 search results - page 1 / 1
» On-line bipartite matching made simple
Sort
View
ICALP
1991
Springer
13 years 8 months ago
On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
Samir Khuller, Stephen G. Mitchell, Vijay V. Vazir...
SIGACT
2008
116views more  SIGACT 2008»
13 years 5 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 thi...
Benjamin E. Birnbaum, Claire Mathieu