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

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

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page.

== 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

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Alon;_Moshkovitz_%26_Safra_(Unweighted_Set-Covering_The_Set-Covering_Problem)"

Navigation menu