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.
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:
Bob Bockholt, "set packing", 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/setpacking.html