View source for Dinur & Steurer ( The Set-Covering Problem)

← Dinur & Steurer ( 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(n^{2} \log n)$

== Space Complexity == 

 

()

== Description == 



== Approximate? == 

Exact

== Randomized? == 

No, deterministic

== Model of Computation == 



== Year == 

2013

== Reference == 

https://www.dsteurer.org/paper/productgames.pdf

Return to Dinur & Steurer ( The Set-Covering Problem).

Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Dinur_%26_Steurer_(_The_Set-Covering_Problem)"

Navigation menu