1 paper
Alina Ene, Alessandro Epasto, Vahab Mirrokni +4
In the maximum coverage problem we are given d subsets from a universe [n], and the goal is to output k subsets such that their union covers the largest possible number of di…