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

From Algorithm Wiki

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/doi/pdf/10.1145/1150334.1150336

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