429 citations · 2.5k across the 69 of their papers we have counts for
1 paper · 1 filter
Hang Hu, Zhao Song, Runzhou Tao +3
Online bipartite matching is a fundamental problem in online algorithms. The goal is to match two sets of vertices to maximize the sum of the edge weights, where for one set of ver…