Dinur & Steurer ( The Set-Covering Problem)

From Algorithm Wiki

Revision as of 09: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^{2} \log n)$

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

2013

Reference

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dinur_%26_Steurer_(_The_Set-Covering_Problem)&oldid=47484"