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 can be rotated by 90 degrees and have to be packed non-overlapping and orthogonal, i.e., axis-parallel. We present an algorithm for this problem with an absolute worst-case ratio of 2, which is optimal provided \(\mathcal{P} \not= \mathcal{NP}\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bansal, N., Caprara, A., Sviridenko, M.: Improved approximation algorithms for multidimensional bin packing problems. In: FOCS: Proc. 47th IEEE Symposium on Foundations of Computer Science, pp. 697–708 (2006)
Bansal, N., Correa, J.R., Kenyon, C., Sviridenko, M.: Bin packing in multiple dimensions - inapproximability results and approximation schemes. Mathematics of Operations Research 31(1), 31–49 (2006)
Caprara, A., Lodi, A., Monaci, M.: Fast approximation schemes for two-stage, two-dimensional bin packing. Mathematics of Operations Research 30(1), 150–172 (2005)
Chlebík, M., Chlebíková, J.: Inapproximability results for orthogonal rectangle packing problems with rotations. In: CIAC: Proc. 6th Conference on Algorithms and Complexity, pp. 199–210 (2006)
Coffman Jr., E.G., Garey, M.R., Johnson, D.S., Tarjan, R.E.: Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing 9(4), 808–826 (1980)
Jansen, K., Solis-Oba, R.: New approximability results for 2-dimensional packing problems. In: MFCS: Proc. 32nd International Symposium on Mathematical Foundations of Computer Science, pp. 103–114 (2007)
Jansen, K., van Stee, R.: On strip packing with rotations. In: STOC: Proc. 37th ACM Symposium on Theory of Computing, pp. 755–761 (2005)
Jansen, K., Zhang, G.: Maximizing the total profit of rectangles packed into a rectangle. Algorithmica 47(3), 323–342 (2007)
Kenyon, C., Rémila, E.: A near optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research 25(4), 645–656 (2000)
Leung, J.Y.-T., Tam, T.W., Wong, C.S., Young, G.H., Chin, F.Y.: Packing squares into a square. Journal of Parallel and Distributed Computing 10(3), 271–275 (1990)
Meir, A., Moser, L.: On packing of squares and cubes. Journal of Combinatorial Theory 5, 126–134 (1968)
Schiermeyer, I.: Reverse-fit: A 2-optimal algorithm for packing rectangles. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 290–299. Springer, Heidelberg (1994)
Steinberg, A.: A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing 26(2), 401–409 (1997)
van Stee, R.: An approximation algorithm for square packing. Operations Research Letters 32(6), 535–539 (2004)
Zhang, G.: A 3-approximation algorithm for two-dimensional bin packing. Operations Research Letters 33(2), 121–126 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Harren, R., van Stee, R. (2008). Packing Rectangles into 2OPT Bins Using Rotations. In: Gudmundsson, J. (eds) Algorithm Theory – SWAT 2008. SWAT 2008. Lecture Notes in Computer Science, vol 5124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69903-3_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-69903-3_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69900-2
Online ISBN: 978-3-540-69903-3
eBook Packages: Computer ScienceComputer Science (R0)