Maximum n-times Coverage for Vaccine Design

Ge Liu, Alexander Dimitrakakis, Brandon Carter +1

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$…