All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 10:24, 15 February 2023 Admin talk contribs created page Unweighted Set-Covering (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...")