Raz & Safra ( 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^{3} \log^{3} n)$

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1997

Reference

https://dl.acm.org/doi/10.1145/258533.258641