Greedy Algorithm ( The Set-Covering Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n^{3} \log n)$
Space Complexity
$O(U)$ words
()
Description
Approximate?
Approximate
Approximation Factor: \ln(n) - \ln(\ln(n)) + \Theta(1)
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1996