Greedy Algorithm ( The Set-Covering Problem)

From Algorithm Wiki
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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Reference

https://dl.acm.org/doi/10.1145/237814.237991

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Greedy_Algorithm_(_The_Set-Covering_Problem)&oldid=44952"