Problemintro
Maximum coverage problem
Also called maximum coverage.
Choose k sets to maximize the number of covered elements.
Choose k sets to maximize the number of covered elements.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag BKGE2P Edit this page History Report an error