Source: wikibot/maximum-coverage-problem
= Maximum coverage problem
{wiki=Maximum_coverage_problem}
The Maximum Coverage Problem is a well-known problem in combinatorial optimization and computer science. It can be described as follows: Given a finite set \\( U \\) (the universe) and a collection of subsets \\( S_1, S_2, \\ldots, S_m \\) of \\( U \\), the goal is to select a certain number \\( k \\) of these subsets such that the number of unique elements covered by the selected subsets is maximized.