Greedy Algorithm ( The Set-Covering Problem)

From Algorithm Wiki

Revision as of 08:49, 10 April 2023 by Admin (talk | contribs)

(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.ezproxy.canberra.edu.au/doi/10.1145/237814.237991

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