Alon; Moshkovitz & Safra (Unweighted Set-Covering The Set-Covering Problem)

From Algorithm Wiki
Revision as of 10:35, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2006 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/1150334.1150336")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(nlogn)$

Space Complexity

()

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

No, deterministic

Model of Computation

Year

2006

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/1150334.1150336

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Alon;_Moshkovitz_%26_Safra_(Unweighted_Set-Covering_The_Set-Covering_Problem)&oldid=44502"