1 citations · 1 across the 1 of their papers we have counts for
1 paper
Thorben Tröbst, Rajan Udwani
In the online hypergraph matching problem, hyperedges of size k over a common ground set arrive online in adversarial order. The goal is to obtain a maximum matching (disjoint se…