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
2003
Highly Cited
2003
The ultrastructure of low resistance junctions between segments of lateral giant fibers in crayfish is studied in sections from… 
Highly Cited
2002
Highly Cited
2002
The ability to form oxide nanorods is of great interest in a number of areas. In this paper, we report the template-based growth… 
Highly Cited
2000
Highly Cited
2000
The synthesis, phase behavior, and mixing properties of cationic dimeric (gemini) surfactants having one or two perfluoroalkyl… 
Highly Cited
1992
Highly Cited
1982
Highly Cited
1982
A nonhomothetic cost function allowing for variable elasticities of scale and substitution and neutral, as well as factor-using… 
Review
1979
Review
1979
Highly Cited
1972
Highly Cited
1972
Multicollector transistors fed by carrier injection are used. A simplified (five masks) standard bipolar process is used…