New Approximability Results for Two-Dimensional Bin Packing

Jansen, Klaus and Pradel, L. (2016) New Approximability Results for Two-Dimensional Bin Packing Algorithmica, 74 (1). pp. 208-269. DOI 10.1007/s00453-014-9943-z.

Full text not available from this repository.

Supplementary data:

Abstract

We study the two-dimensional bin packing problem: Given a list of rectangles the objective is to find a feasible, i.e. axis-parallel and non-overlapping, packing of all rectangles into the minimum number of unit sized squares, also called bins. Our problem consists of two versions; in the first version it is not allowed to rotate the rectangles while in the other it is allowed to rotate the rectangles by , i.e. to exchange the widths and the heights. Two-dimensional bin packing is a generalization of its one-dimensional counterpart and is therefore strongly -hard. Furthermore Bansal et al. (Math Oper Res 31(1):31-49, 2006) showed that even an is ruled out for this problem, unless . This lower bound of asymptotic approximability was improved by Chlebik and Chlebikova (J Discrete Algorithms 7(3):291-305, 2009) to values and for the version with and without rotations, respectively. On the positive side there is an asymptotic 1.69.. approximation by Caprara (Math Oper Res 33:203-215, 2008) without rotations and an asymptotic 1.52... approximation by Bansal et al. (SIAM J Comput 39(4):1256-1278, 2009) for both versions. We give a new asymptotic upper bound for both versions of our problem: For any fixed and any instance that fits optimally into bins, our algorithm computes a packing into bins in the version without rotations and bins in the version with rotations. The algorithm has polynomial running time in the input length. In our new technique we consider an optimal packing of the rectangles into the bins. We cut a small vertical or horizontal strip out of each bin and move the intersecting rectangles into additional bins. This enables us to either round the widths of all wide rectangles, or the heights of all long rectangles in this bin. After this step we round the other unrounded side of these rectangles and we achieve a solution with a simple structure and only few types of rectangles. Our algorithm initially rounds the instance and computes a solution that nearly matches the modified optimal solution.

Document Type: Article
Additional Information: Times Cited: 1 Jansen, Klaus Praedel, Lars
Research affiliation: OceanRep > The Future Ocean - Cluster of Excellence
Kiel University
Refereed: Yes
DOI etc.: 10.1007/s00453-014-9943-z
ISSN: 0178-4617
Projects: Future Ocean
Date Deposited: 14 Mar 2017 15:14
Last Modified: 19 Dec 2017 12:42
URI: http://eprints.uni-kiel.de/id/eprint/36155

Actions (login required)

View Item View Item