Chvatal greedy heuristic (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:3511:35, 15 February 2023‎ Admin talk contribs‎ 455 bytes +455‎ Created page with "== Time Complexity == $O(dn^{2})$ == Space Complexity == $O(dm)$ (Derived -- worst case, updating each set in S to be something else and we don't want to change the input) == Description == == Approximate? == Approximate Approximation Factor: ln n - lnln n + \Theta(1) == Randomized? == No, deterministic == Model of Computation == == Year == 1979 == Reference == https://www.jstor.org/stable/3689577#metadata_info_tab_contents"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Chvatal_greedy_heuristic_(Weighted_Set-Covering_The_Set-Covering_Problem)"