Brute force ( The Set-Covering Problem)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(U {2}^n)$

Space Complexity

$O(U)$ words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1972

Reference

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