Raz & Safra ( 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.

10 April 2023

15 February 2023

  • curprev 10:5310:53, 15 February 2023‎ Admin talk contribs‎ 279 bytes +279‎ Created page with "== Time Complexity == $O(n^{3} log^{3} n)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/258533.258641"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Raz_%26_Safra_(_The_Set-Covering_Problem)"