OurBigBook About$ Donate
 Sign in Sign up

Maximum coverage problem

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Combinatorics Families of sets
 0 By others on same topic  0 Discussions Create my own version
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.

 Ancestors (5)

  1. Families of sets
  2. Combinatorics
  3. Fields of mathematics
  4. Mathematics
  5.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook