1 citations · 1 across the 1 of their papers we have counts for
1 paper
Steven Delong, Alireza Farhadi, Rad Niazadeh +2
We study the classic online bipartite matching problem with a twist: offline vertices, called resources, are reusable. In particular, when a resource is matched to an on…