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 17 December 2004.
HTML page formatted Mon Nov 18 10:44:10 2013.
Cite this as:
Paul E. Black, "set cover", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/setcover.html