Before revision: In the maximum n-times coverage problem , we are provided a set of elements, a weight for each element, and a set of overlays where each overlay specifies an element specific coverage of zero or more times. The goal is to select up to k overlays such that the sum of the weights of elements that are covered at least n times is maximized .
After revision: In 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 is maximized .