Abstract
In this paper, we study the bounded space variation, especially 1-bounded space, of 2-dimensional bin packing. A sequence of rectangular items arrive over time, and the following item arrives after the packing of the previous one. The height and width of each item are no more than 1, we need to pack these items into unit square bins of size 1×1 and our objective is to minimize the number of used bins. Once an item is packed into a square bin, the position of this item is fixed and it cannot be shifted within this bin. At any time, there is at most one active bin; the current unpacked item can be only packed into the active bin and the inactive bins (closed at some previous time) cannot be used for any future items. We first propose an online algorithm with a constant competitive ratio 12, then improve the competitive ratio to 8.84 by the some complicated analysis. Our results significantly improve the previous best known O((loglogm)2)-competitive algorithm[10], where m is the width of the square bin and the size of each item is a×b, where a, b are integers no more than m. Furthermore, the lower bound for the competitive ratio is also improved to 2.5.
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., Correa, J.R., Kenyon, C., Sviridenko, M.: Bin Packing in Multiple Dimensions: In-approximability Results and Approximation Schemes. Mathematics of Operations Research 31(1), 31–49 (2006)
Bansal, N., Caprara, A., Sviridenko, M.: Improved approximation algorithm for multidimensional bin packing problems. In: FOCS 2006, pp. 697–708 (2006)
Blitz, D., van Vliet, A., Woeginger, G.J.: Lower bounds on the asymptotic worst-case ratio of on-line bin packing algorithms (1996) (unpublished manuscript)
Caprara, A.: Packing 2-dimensional bins in harmony. In: FOCS 2002, pp. 490–499 (2002)
Chung, F.R.K., Garey, M.R., Johnson, D.S.: On packing two-dimensional bins. SIAM J. Algebraic Discrete Methods 3(1), 66–76 (1982)
Csirik, J., Johnson, D.S.: Bounded Space On-Line Bin Packing: Best is Better than First. Algorithmica 31, 115–138 (2001)
Epstein, L., van Stee, R.: Optimal Online Algorithms for Multidimensional Packing Problems. SIAM Jouranl on Computing 35(2), 431–448 (2005)
Epstein, L., van Stee, R.: Online square and cube packing. Acta Inf. 41(9), 595–606 (2005)
Ferreira, C.E., Miyazawa, E.K., Wakabayashi, Y.: Packing squares into squares. Pesquisa Operacional 19, 223–237 (1999)
Fujita, S.: On-Line Grid-Packing with a Single Active Grid. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 476–483. Springer, Heidelberg (2002)
Han, X., Chin, F., Ting, H.-F., Zhang, G., Zhang, Y.: A New Upper Bound on 2D Online Bin Packing (manuscript)
Han, X., Iwama, K., Zhang, G.: Online removable square packing. Theory of Computing Systems 43(1), 38–55 (2008)
Januszewski, J., Lassak, M.: On-line packing sequences of cubes in the unit cube. Geometriae Dedicata 67, 285–293 (1997)
Johnson, D.S., Demers, A.J., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-Case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing 3(4), 299–325 (1974)
Lee, C.C., Lee, D.T.: A simple on-line bin packing algorithm. J. Assoc. Comput. Mach. 32, 562–572 (1985)
Leung, J.Y.-T., Tam, T.W., Wong, C.S., Young, G.H., Chin, F.Y.L.: Packing squares into a square. J. Parallel Distrib. Comput. 10, 271–275 (1990)
Kohayakawa, Y., Miyazawa, F.K., Raghavan, P., Wakabayashi, Y.: Multidimensionalcube packing. Algorithmica 40(3), 173–187 (2004)
Meir, A., Moser, L.: On packing of squares and cubes. Journal of Combinatorial Theory 5, 126–134 (1968)
Ramanan, P.V., Brown, D.J., Lee, C.C., Lee, D.T.: On-line bin packing in linear time. Journal of Algorithms 10, 305–326 (1989)
Seiden, S.S.: On the online bin packing problem. J. ACM 49, 640–671 (2002)
van Vliet, A.: An improved lower bound for on-line bin packing algorithms. Information Processing Letters 43, 277–284 (1992)
Yao, A.C.-C.: New Algorithms for Bin Packing. Journal of the ACM 27, 207–227 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chin, F.Y.L., Ting, HF., Zhang, Y. (2009). 1-Bounded Space Algorithms for 2-Dimensional Bin Packing. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-10631-6_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10630-9
Online ISBN: 978-3-642-10631-6
eBook Packages: Computer ScienceComputer Science (R0)