Abstract
We show a new algorithm and improved bound for the online square-into-square packing problem using a hybrid shelf-packing approach. This 2-dimensional packing problem involves packing an online sequence of squares into a unit square container without any two squares overlapping. We seek the largest area \(\alpha \) such that any set of squares with total area at most \(\alpha \) can be packed. We show an algorithm that packs any online sequence of squares with total area \(\alpha \le 2/5\), improving upon recent results of \(11/32\) [3] and \(3/8\) [8]. Our approach allows all squares smaller than a chosen maximum height \(h\) to be packed into the same fixed height shelf. We combine this with the introduction of variable height shelves for squares of height larger than \(h\). Some of these techniques can be extended to the more general problems of rectangle packing with rotation and bin packing.
This work has been supported partially by NSF award CCF-1218620. I also want to thank my mentor Prof. Gandhi for all his support.
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
Similar content being viewed by others
References
Moon, J., Moser, L.: Some packing and covering theorems. Colloq. Mathematicum 17, 103–110 (1967)
Han, X., Iwama, K., Zhang, G.: Online removable square packing. Theory Comput. Syst. 43(1), 38–55 (2008)
Fekete, S., Hoffmann, H.: Online square-into-square packing. In: Proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 126–141 (2013)
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(3), 271–275 (1990)
Moser, L.: Poorly formulated unsolved problems of combinatorial geometry. Mimeographed (1966)
Hougardy, S.: On packing squares into a rectangle. Comput. Geom.: Theory Appl. 44(8), 456–463 (2011)
Januszewski, J., Lassak, M.: On-line packing sequences of cubes in the unit cube. Geometriae Dedicata 67(3), 285–293 (1997)
Brubach, B.: Improved online square-into-square packing (2014). http://arxiv.org/abs/1401.5583
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Brubach, B. (2015). Improved Bound for Online Square-into-Square Packing. In: Bampis, E., Svensson, O. (eds) Approximation and Online Algorithms. WAOA 2014. Lecture Notes in Computer Science(), vol 8952. Springer, Cham. https://doi.org/10.1007/978-3-319-18263-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-18263-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18262-9
Online ISBN: 978-3-319-18263-6
eBook Packages: Computer ScienceComputer Science (R0)