The maximum coverage problem is a classical question in computer science, computational complexity theory, and operations research.It is a problem that is widely taught in approximation algorithms. As input you are given several sets and a number . The sets may have some elements in common. You must select at most of these sets such that the maximum number of elements are covered, i.e. the union of the selected sets has maximal size. Formally, (unweighted) Maximum Coverage