Integer linear program Vazirani (Unweighted Set-Covering; Weighted Set-Covering The Set-Covering Problem): 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.

    15 February 2023

    • curprev 11:5311:53, 15 February 2023‎ Admin talk contribs‎ 345 bytes +345‎ Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(U)$ words () == Description == ILP == Approximate? == Approximate Approximation Factor: \log n == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2001 == Reference == https://link.springer.com/chapter/10.1007/978-3-662-04565-7_13"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Integer_linear_program_Vazirani_(Unweighted_Set-Covering;_Weighted_Set-Covering_The_Set-Covering_Problem)"