NIST

set packing

(classic problem)

Definition: An optimization problem to find the largest number of mutually disjoint subsets that cover a given set of sets.

See also partition, vertex cover, bin packing problem.

Author: BB

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 2 September 2014.
HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:
Bob Bockholt, "set packing", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 2 September 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/setpacking.html