1 citations · 2 across the 5 of their papers we have counts for
1 paper · 1 filter
Milena Mihail, Thorben Tröbst
We study the classical, randomized Ranking algorithm which is known to be (1−e1)-competitive in expectation for the Online Bipartite Matching Problem. We give a tail i…