Lund & Yannakakis ( The Set-Covering Problem)

From Algorithm Wiki

Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1994 == Reference == https://doi-org.ezproxy.canberra.edu.au/10.1145%2F185675.306789")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O({2}^n)$

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1994

Reference

https://doi-org.ezproxy.canberra.edu.au/10.1145%2F185675.306789

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Lund_%26_Yannakakis_(_The_Set-Covering_Problem)&oldid=44955"