Raz & Safra ( The Set-Covering Problem)
Jump to navigation
Jump to search
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