Unweighted Set-Covering: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 10:2410:24, 15 February 2023‎ Admin talk contribs‎ 2,315 bytes +2,315‎ Created page with "{{DISPLAYTITLE:Unweighted Set-Covering (The Set-Covering Problem)}} == Description == Given a universe $U$, i.e. a set of elements $\{1, 2, \ldots, n\}$, and a collection $S$ of $m$ sets whose union is the universe, identify the smallest sub-collection of $S$ whose union is the universe. == Related Problems == Generalizations: Weighted Set-Covering == Parameters == <pre>U: the universe of elements to be covered S: the collection of sets n: number of elements..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Unweighted_Set-Covering"