1 code implementation • ICLR 2022 • Ge Liu, Alexander Dimitrakakis, Brandon Carter, David Gifford
We introduce the maximum $n$-times coverage problem that selects $k$ overlays to maximize the summed coverage of weighted elements, where each element must be covered at least $n$ times.
