Feige ( The Set-Covering Problem)
Revision as of 11:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")
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