Thorben Tröbst

Almost Tight Bounds for Online Hypergraph Matching

2024 · arXiv (Cornell University)

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 set of hyperedges). A naïve greedy …