Feige ( The Set-Covering Problem)
Jump to navigation
Jump to search
Time Complexity
$O({2}^n)$
Space Complexity
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1998
Reference
https://courses.cs.duke.edu/spring07/cps296.2/papers/p634-feige.pdf