Maximum Coverage in Sublinear Space, Faster

Stephen Jaud, Anthony Wirth, Farhana Choudhury

Given a collection of $m$ sets from a universe $\mathcal{U}$, the Maximum Set Coverage problem consists of finding $k$ sets whose union has largest cardinality. This problem is NP-…