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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
The number of publications in the area of Cutting and Packing (C&P) has increased considerably over the last two decades. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Given a k-uniform hypergraph, the Maximum k -Set Packing problem is to find the maximum disjoint set of edges. We prove that this… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Given a collection of weighted sets, each containing at most k elements drawn from a finite base set, the kset packing problem is… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The earliest and the most critical stage in VLSI layout design is the placement. The background of which is the rectangle packing… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
This paper addresses the question: how should N n-dimensional subspaces of m-dimensional Euclidean space be arranged so that they… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We propose new R-tree packing techniques for static databases. Given a collection of rectangles , we sort them and we build the R… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
A unified and powerful approach is presented for devising polynomial approximation schemes for many strongly NP-complete problems… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
A cover in a graph G is a set of vertices C such that each edge of G has at least one endpoint in C. The vertex cover problem is… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
This paper was motivated by a practical problem related to databases for image processing: given a set of points in the plane… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1973
Highly Cited
1973
In this paper we address ourselves to identifying facets of the set packing polyhedron, i.e., of the convex hull of integer… (More)
Is this relevant?