Definition: A set of sets whose union has all members of the union of all sets. The set cover problem is to find a minimum size set.
Formal Definition: Given a set S of sets, choose c ⊆ S such that Ui=1 ci = Ui=1 Si.
See also covering.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 2 September 2014.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "set cover", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 2 September 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/setcover.html