TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING
2013 ◽
Vol 24
(08)
◽
pp. 1299-1327
◽
Keyword(s):
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of unit bins without rotating the rectangles. Beyond its theoretical appeal, this problem has many practical applications, for example in print layout and VLSI chip design. We present a 2-approximate algorithm, which improves over the previous best known ratio of 3, matches the best results for the problem where rotations are allowed and also matches the known lower bound of approximability. Our approach makes strong use of a PTAS for a related 2D knapsack problem and a new algorithm that can pack instances into two bins if OPT = 1.
2007 ◽
Vol 35
(3)
◽
pp. 365-373
◽
2002 ◽
Vol 118
(1-2)
◽
pp. 13-24
◽
2007 ◽
Vol 35
(3)
◽
pp. 357-364
◽
Keyword(s):
Keyword(s):
Keyword(s):
2016 ◽
Vol 14
◽
pp. 13-22
Keyword(s):