{"version":"1.0","type":"link","title":"Set packing - Newikis","description":"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 (in…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}