Alon; Moshkovitz & Safra (Unweighted Set-Covering The Set-Covering Problem)
Jump to navigation
Jump to search
Time Complexity
$O(nlogn)$
Space Complexity
()
Description
Approximate?
Approximate
Approximation Factor:
Randomized?
No, deterministic
Model of Computation
Year
2006
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/1150334.1150336