2 citations · 2 across the 3 of their papers we have counts for
1 paper · 1 filter
Marcin Bienkowski, Jarosław Byrka, Łukasz Jeż
In the online disjoint set covers problem, the edges of a hypergraph are revealed online, and the goal is to partition them into a maximum number of disjoint set covers. That is, n…