Chvatal greedy heuristic (Weighted Set-Covering The Set-Covering Problem)
Jump to navigation
Jump to search
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