44 search results - page 1 / 9 » Maximizing the Number of Packed Rectangles |
SWAT
2004
Springer
14 years 21 days ago
2004
Springer
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...
MOR
2006
13 years 7 months ago
2006
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 ...
ORL
2006
13 years 7 months ago
2006
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...
APPROX
2009
Springer
14 years 1 months ago
2009
Springer
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...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
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...