Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2006

Highly Cited

2006

Abstract.Given a k-uniform hypergraph, the Maximumk -Set Packing problem is to find the maximum disjoint set of edges. We prove…

Review

2002

Review

2002

We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the…

Highly Cited

2000

Highly Cited

2000

The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into the minimum…

Highly Cited

1997

Highly Cited

1997

MOLREP is an automated program for molecular replacement which utilizes effective new approaches in data processing and…

Highly Cited

1990

Highly Cited

1990

A new form of pure, solid carbon has been synthesized consisting of a somewhat disordered hexagonal close packing of soccer-ball…

Highly Cited

1990

Highly Cited

1990

Introduction knapsack problem bounded knapsack problem subset-sum problem change-making problem multiple knapsack problem…

Highly Cited

1988

Highly Cited

1988

Approach your problems from the right end It isn't that they can't see the solution. It is and begin with the answers. Then one…

Highly Cited

1983

Highly Cited

1983

Abstract In this paper we describe a collection of efficient algorithms that deliver approximate solution to the weighted stable…

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…

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…