(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
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 2 November 2020.
HTML page formatted Mon Nov 2 12:36:42 2020.
Cite this as:
Bob Bockholt, "set packing", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 2 November 2020. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/setpacking.html