16 search results - page 1 / 4 » Improved Absolute Approximation Ratios for Two-Dimensional P... |
APPROX
2009
Springer
15 years 4 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...
SWAT
2004
Springer
15 years 2 months 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...
100
click to vote
IPCO
2008
14 years 11 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
AAIM
2008
Springer
15 years 3 months ago
2008
Springer
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...
TAMC
2007
Springer
15 years 3 months ago
2007
Springer
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...