e/Maximum coverage problem

Information
has gloss	eng: The maximum coverage problem is a classical question in computer science and computational complexity theory. It is a problem whose widely taught in approximation algorithms.
lexicalization	eng: maximum coverage problem
instance of	e/Family of sets