NIST

set cover

(classic problem)

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.

Author: PEB

Implementation

(Pascal)
Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 15 July 2019.
HTML page formatted Mon Jul 15 12:55:43 2019.

Cite this as:
Paul E. Black, "set cover", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 15 July 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/setcover.html