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 E. Black.

Entry modified 17 December 2004.
HTML page formatted Tue Dec 6 16:16:32 2011.

Cite this as:
Bob Bockholt, "set packing", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/setpacking.html

to NIST home page