Abstract
We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles have to be packed non-overlapping and orthogonal, i.e., axis-parallel. We present an algorithm with an absolute worst-case ratio of 2 for the case where the rectangles can be rotated by 90 degrees. This is optimal provided \(\mathcal{P}\not=\mathcal{NP}\) . For the case where rotation is not allowed, we prove an approximation ratio of 3 for the algorithm Hybrid First Fit which was introduced by Chung et al. (SIAM J. Algebr. Discrete Methods 3(1):66–76, 1982) and whose running time is slightly better than the running time of Zhang’s previously known 3-approximation algorithm (Zhang in Oper. Res. Lett. 33(2):121–126, 2005).
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Bansal, N., Caprara, A., & Sviridenko, M. (2006a). Improved approximation algorithms for multidimensional bin packing problems. In FOCS: proceedings of the 47nd IEEE symposium on foundations of computer science (pp. 697–708).
Bansal, N., Correa, J. R., Kenyon, C., & Sviridenko, M. (2006b). Bin packing in multiple dimensions—inapproximability results and approximation schemes. Mathematics of Operations Research, 31(1), 31–49.
Caprara, A., Lodi, A., & Monaci, M. (2005). Fast approximation schemes for two-stage, two-dimensional bin packing. Mathematics of Operations Research, 30(1), 150–172.
Chlebík, M., & Chlebíková, J. (2006). Inapproximability results for orthogonal rectangle packing problems with rotations. In CIAC: proceedings of the 6th conference on algorithms and complexity (pp. 199–210).
Chung, F. R. K., Garey, M. R., & Johnson, D. S. (1982). On packing two-dimensional bins. SIAM Journal on Algebraic and Discrete Methods, 3(1), 66–76.
Coffman, E. G. Jr., Garey, M. R., Johnson, D. S., & Tarjan, R. E. (1980). Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9(4), 808–826.
Jansen, K., & Solis-Oba, R. (2007). New approximability results for 2-dimensional packing problems. In MFCS: proceedings of the 32nd international symposium on mathematical foundations of computer science (pp. 103–114).
Jansen, K., & van Stee, R. (2005). On strip packing with rotations. In STOC: proceedings of the 37th ACM symposium on theory of computing (pp. 755–761).
Jansen, K., & Zhang, G. (2007). Maximizing the total profit of rectangles packed into a rectangle. Algorithmica, 47(3), 323–342.
Johnson, D. S. (1973). Near optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology, Department of Mathematics.
Kenyon, C., & Rémila, E. (2000). A near optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research, 25(4), 645–656.
Leung, J. Y.-T., Tam, T. W., Wong, C. S., Young, G. H., & Chin, F. Y. (1990). Packing squares into a square. Journal of Parallel and Distributed Computing, 10(3), 271–275.
Meir, A., & Moser, L. (1968). On packing of squares and cubes. Journal of Combinatorial Theory, 5(2), 126–134.
Schiermeyer, I. (1994). Reverse-fit: A 2-optimal algorithm for packing rectangles. In ESA: proceedings of the 2nd European symposium on algorithms (pp. 290–299).
Steinberg, A. (1997). A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing, 26(2), 401–409.
van Stee, R. (2004). An approximation algorithm for square packing. Operations Research Letters, 32(6), 535–539.
Zhang, G. (2005). A 3-approximation algorithm for two-dimensional bin packing. Operations Research Letters, 33(2), 121–126.
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version was published in the Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT): LNCS 5124, pp. 306–318, Springer-Verlag Berlin Heidelberg 2008.
Research supported by German Research Foundation (DFG). Parts of this work were done while this author was at the University of Karlsruhe.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Harren, R., van Stee, R. Absolute approximation ratios for packing rectangles into bins. J Sched 15, 63–75 (2012). https://doi.org/10.1007/s10951-009-0110-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-009-0110-3