Sciweavers

44 search results - page 1 / 9
» Maximizing the Number of Packed Rectangles
Sort
View
SWAT
2004
Springer
117views Algorithms» more  SWAT 2004»
13 years 9 months ago
Maximizing the Number of Packed Rectangles
Given a set of rectangles we are asked to pack as many of them as possible into a bigger rectangle. The rectangles packed may not overlap and may not be rotated. This problem is NP...
Klaus Jansen, Guochuan Zhang
MOR
2006
123views more  MOR 2006»
13 years 4 months ago
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into ...
Nikhil Bansal, José R. Correa, Claire Kenyo...
ORL
2006
91views more  ORL 2006»
13 years 4 months ago
Resource augmentation in two-dimensional packing with orthogonal rotations
We consider the problem of packing two-dimensional rectangles into the minimum number of unit squares, when 90 rotations are allowed. Our main contribution is a polynomial-time al...
José R. Correa
APPROX
2009
Springer
177views Algorithms» more  APPROX 2009»
13 years 10 months ago
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
Abstract. We consider the two-dimensional bin packing and strip packing problem, where a list of rectangles has to be packed into a minimal number of rectangular bins or a strip of...
Rolf Harren, Rob van Stee
SODA
2004
ACM
203views Algorithms» more  SODA 2004»
13 years 5 months ago
Approximation schemes for multidimensional packing
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
José R. Correa, Claire Kenyon