Greedy Algorithm ( The Set-Covering Problem): Difference between revisions
Jump to navigation
Jump to search
(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.ezproxy.canberra.edu.au/doi/10.1145/237814.237991") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{3} log n)$ | $O(n^{3} \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 09:49, 10 April 2023
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.ezproxy.canberra.edu.au/doi/10.1145/237814.237991