Keywords

#set_packing

Set packing

Problem in computer science

Set packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems. Suppose one has a finite set S and a list of subsets of S. Then, the set packing problem asks if some k subsets in the list are pairwise disjoint.

Wed 31st

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Set packing Packing problems Set cover problem Bin packing problem Independent set (graph theory) Rectangle packing 3-dimensional matching Disjoint sets Linear programming Packing density
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.