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:  Maximum n-times coverage objective is not submodular, and we present an efficient solution by sequential greedy optimization.