Abstract
Any list of rectangular items of total area not greater than 0.2837 can be packed online into the unit square (\(90^{\circ }\)-rotations are allowed). Furthermore, we describe a 4.84-competitive 1-space bounded 2-dimensional bin packing algorithm and present the lower bound of 3.246 for the competitive ratio.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Brubach, B.: Improved online square-into-square packing. arxiv.org/pdf/1401.5583.pdf
Brubach, B.: Improved bound for online square-into-square packing. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 47–58. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-18263-6_5
Zhang, Y., Chen, J., Chin, F.Y.L., Han, X., Ting, H.-F., Tsin, Y.H.: Improved online algorithms for 1-space bounded 2-dimensional bin packing. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6507, pp. 242–253. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17514-5_21
Chin, F.Y.L., Han, X., Poon, C.K., Ting, H.-F., Tsin, Y.H., Ye, D., Zhang, Y.: Online algorithms for 1-space bounded 2-dimensional bin packing and square packing. Theor. Comput. Sci. 554, 135–149 (2014)
Chin, F.Y.L., Ting, H.-F., Zhang, Y.: 1-space bounded algorithms for 2-dimensional bin packing. In: Proceedings of the 20th Annual International Symposium on Algorithms and Computation (ISAAC), pp. 321–330 (2009)
Chin, F.Y.L., Ting, H.-F., Zhang, Y.: One-space bounded algorithms for two-dimensional bin packing. Int. J. Found. Comput. Sci. 21(6), 875–891 (2010)
Epstein, L., van Stee, R.: Optimal online algorithms for multidimensional packing problems. SIAM J. Comput. 35(2), 431–448 (2005)
Fekete, S.P., Hoffmann, H.-F.: Online square-into-square packing. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) APPROX/RANDOM -2013. LNCS, vol. 8096, pp. 126–141. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40328-6_10
Grzegorek, P., Januszewski, J.: Online algorithms for \(3\)-space bounded \(2\)-dimensional bin packing and square packing. Rom. J. Inf. Sci. Technol. 17(2), 189–202 (2014)
Grzegorek, P., Januszewski, J.: A note on one-space bounded square packing. Inf. Process. Lett. 115, 872–876 (2015)
Han, X., Iwama, K., Zhang, G.: Online removable square packing. Theory Comput. Syst. 43(1), 38–55 (2008)
Januszewski, J.: Packing rectangles into the unit square. Geom. Dedicata 8, 13–18 (2000)
Januszewski, J., Lassak, M.: On-line packing sequences of cubes in the unit cube. Geom. Dedicata 67, 285–293 (1997)
Januszewski, J., Zielonka, Ł.: Improved online algorithms for 2-space bounded 2-dimensional bin packing. Int. J. Found. Comput. Sci. 27(4), 407–429 (2016)
Johnson, D.S.: Fast algorithms for bin packing. J. Comput. Syst. Sci. 8, 272–314 (1974)
Lassak, M.: On-line potato-sack algorithm efficient for packing into small boxes. Periodica Math. Hung. 34, 105–110 (1997)
Lee, C.C., Lee, D.T.: A simple on-line bin packing algorithm. J. ACM 32, 562–572 (1985)
Moser, L.: Poorly formulated unsolved problems of combinatorial geometry. Mimeographed (1966)
Moon, J., Moser, L.: Some packing and covering theorems. Colloq. Math. 17, 103–110 (1967)
Zhao, X., Shen, H.: On-line algorithms for 2-space bounded cube and hypercube packing. Tsinghua Sci. Technol. 20(3), 255–263 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Januszewski, J., Zielonka, Ł. (2018). Online Packing of Rectangular Items into Square Bins. In: Solis-Oba, R., Fleischer, R. (eds) Approximation and Online Algorithms. WAOA 2017. Lecture Notes in Computer Science(), vol 10787. Springer, Cham. https://doi.org/10.1007/978-3-319-89441-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-89441-6_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-89440-9
Online ISBN: 978-3-319-89441-6
eBook Packages: Computer ScienceComputer Science (R0)