Weighted 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 11:2411:24, 15 February 2023‎ Admin talk contribs‎ 2,285 bytes +2,285‎ Created page with "{{DISPLAYTITLE:Weighted Set-Covering (The Set-Covering Problem)}} == Description == The set-covering problem where each set $s\in S$ is assigned a weight and the goal is to find the minimum weight sub-collection of $S$ that covers the universe. == Related Problems == Subproblem: Unweighted Set-Covering == Parameters == <pre>n: number of elements in the universe m: number of sets in the collection d: size of the largest set in collection H(x): the xth Harmonic..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Weighted_Set-Covering"