Dinur & Steurer ( The Set-Covering Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2} \log n)$
Space Complexity
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
2013