Lund & Yannakakis ( 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
1994
Reference
https://doi-org.ezproxy.canberra.edu.au/10.1145%2F185675.306789