Greedy Algorithm ( The Set-Covering Problem)
Revision as of 11:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference == https://dl.acm.org/doi/10.1145/237814.237991")
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