4 citations · 5 across the 4 of their papers we have counts for
1 paper · 1 filter
Haim Kaplan, David Naori, Danny Raz
We study the greedy-based online algorithm for edge-weighted matching with (one-sided) vertex arrivals in bipartite graphs, and edge arrivals in general graphs. This algorithm was…