# Set packing

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2007

Highly Cited

2007

- European Journal of Operational Research
- 2007

The number of publications in the area of Cutting and Packing (C&P) has increased considerably over the last two decades. Theâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- computational complexity
- 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

- SODA
- 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

- IEEE Trans. on CAD of Integrated Circuits andâ€¦
- 1996

The earliest and the most critical stage in VLSI layout design is the placement. The background of which is the rectangle packingâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Experimental Mathematics
- 1996

This paper addresses the question: how should N n-dimensional subspaces of m-dimensional Euclidean space be arranged so that theyâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- CIKM
- 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

- J. ACM
- 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

- Discrete Applied Mathematics
- 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

- Inf. Process. Lett.
- 1981

This paper was motivated by a practical problem related to databases for image processing: given a set of points in the planeâ€¦Â (More)

Is this relevant?

Highly Cited

1973

Highly Cited

1973

- Math. Program.
- 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?