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.
Highly Cited
2008
Highly Cited
2008
A relay selection approach has previously been shown to outperform repetition-based scheduling for both amplify-and-forward (AF… 
Highly Cited
2006
Highly Cited
2006
Enhanced and anisotropic field-effect mobility of thin-film transistors based on pentacene was obtained on a substrate covered… 
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
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
In this paper we refer to a specific class of Dynamic Channel Allocation (DCA) strategies, namely the interferencefree, timid… 
1994
1994
The properties of thin organic films offer many challenging opportunities for science and technology. A crucial requirement for… 
1991
1991
We examine the dependence on spatial dimension D of the Mayer cluster integrals that determine the virial coefficients Bn for a… 
Highly Cited
1989
Highly Cited
1989
Liddell, C. M., and Parke, J. L. 1989. Enhanced colonization of pea taproots by a fluorescent pseudomonad biocontrol agent by… 
Highly Cited
1984
Highly Cited
1984
We have previously shown that diffusion and fluid flow within a liquid may be interpreted as transitions between mechanically…