I am looking for an R package that solves Set Cover Problem. As Wikipedia
explains:
Given a set of elements [image: \{1,2,...,m\}] (called the universe) and a
set [image: S] of [image: n] sets whose union equals the universe, the set
cover problem is to identify the smallest subset of [image: S] whose union
equals the universe. For example, consider the universe [image: U = \{1, 2,
3, 4, 5\}] and the set of sets [image: S = \{\{1, 2, 3\}, \{2, 4\}, \{3,
4\}, \{4, 5\}\}]. Clearly the union of [image: S] is [image: U]. However,
we can cover all of the elements with the following, smaller number of
sets: [image: \{\{1, 2, 3\}, \{4, 5\}\}].
Thank you,
Kumar Mainali
Postdoctoral Fellow
Environmental Science Institute
The University of Texas at Austin
ᐧ
[[alternative HTML version deleted]]
______________________________________________
R-help@r-project.org mailing list -- To UNSUBSCRIBE and more, see
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.
