1 citations · 1 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024★ 1 cited
Almost Tight Bounds for Online Hypergraph Matching
Thorben Tröbst, Rajan Udwani
In the online hypergraph matching problem, hyperedges of size over a common ground set arrive online in adversarial order. The goal is to obtain a maximum matching (disjoint se…
cs.DS2021
Online Matching with High Probability
Milena Mihail, Thorben Tröbst
We study the classical, randomized Ranking algorithm which is known to be -competitive in expectation for the Online Bipartite Matching Problem. We give a tail i…