Skip to search formSkip to main contentSkip to account menu

Set packing

Known as: Maximum set packing, Packing 
Set packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2004
Review
2004
Recent advances in the field of organic molecular electronics include an increasingly significant role of discotic structures… 
Highly Cited
2004
Highly Cited
2004
We propose a novel class of provably good codes which are a serial concatenation of a single-parity-check (SPC)-based product… 
Highly Cited
1998
Highly Cited
1998
It is generally believed that cyano functionality is "toxic" to the classical MoCl5- and WCl6- based metathesis catalysts, but we… 
Highly Cited
1996
Highly Cited
1996
Nanocrystalline films of TiO2, Al2O3, and ZrO2 were used as hosts for the merocyanine 3-acetyl-5-(2-(3-ethyl-2… 
Review
1996
Review
1996
Organic nonlinear optical (NLO) materials, both single crystals and polymers, based on extended π-electron systems have been… 
Highly Cited
1995
Highly Cited
1995
Permittivity measurements were taken from 0.2 to 20 GHz on fresh peaches of three varieties at three stages of maturity during… 
Highly Cited
1995
Highly Cited
1995
In this paper we refer to a specific class of Dynamic Channel Allocation (DCA) strategies, namely the interferencefree, timid… 
Highly Cited
1984
Highly Cited
1984
For more than half a century, the cornerstone to our understanding of molecular organization in amphiphilic aggregates has been… 
Review
1979
Review
1979