Greedy Algorithm ( 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 11:5311:53, 15 February 2023‎ Admin talk contribs‎ 356 bytes +356‎ Created page with "== Time Complexity == $O(n^{3} log n)$ == Space Complexity == $O(U)$ words () == Description == == Approximate? == Approximate Approximation Factor: \ln(n) - \ln(\ln(n)) + \Theta(1) == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1996 == Reference == https://dl.acm.org/doi/10.1145/237814.237991"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Greedy_Algorithm_(_The_Set-Covering_Problem)"