Before revision:  We show that the n-times coverage objective is not submodular, and we present an efficient solution by sequential greedy optimization.
After revision:  We show that the n-times coverage is a generalization of the multi-set multi-cover problem, is NP-complete, and is not submodular. We introduce two new practical solutions for n-times coverage based on integer linear programming and sequential greedy optimization.