Set packing

The amount of packing problem (often with set -packing problem listed ) is a decision problem in combinatorics.

It asks if there are a finite set and subsets of a number of at least pairwise disjoint subsets.

Formulated as an optimization problem, a pack is sought with as many subsets or, if the subsets are assigned ratings, a pack with maximum rating.

The amount of packing problem belongs to the list of 21 classic NP -complete problems of which Richard M. Karp 1972, the membership was able to show to the class.

Recursive set Disjoint sets Clique problem Feedback Arc Set Feedback Vertex Set Boolean satisfiability problem#3-satisfiability Vertex cover#Vertex cover in hypergraphs Maximum cut
563761
de