Abstract
The online removable square packing problem is a two-dimen-sional version of the online removable Knapsack problem. For a sequence of squares with side length at most 1, we are requested to pack a subset of them into a unit square bin in an online fashion where the online player can decide whether to take the current square or not and which squares currently in the unit square to remove. The goal is to maximize the total packed area. Our results include: (i) No online algorithm can achieve a better competitive ratio than \((\sqrt{5}+3)/2\approx 2.618\) . (ii) The matching upper bound is achieved by a relatively simple online algorithm if repacking is allowed. (iii) Without repacking, we can achieve an upper bound of 3 by using the concept of bricks of Januszewski and Lassak. (iv) The offline version of the problem admits a PTAS.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bansal, N., Sviridenko, M.: New approximability and inapproximability results for 2-dimensional bin packing. In: SODA, pp. 189–196 (2004)
Caprara, A., Monaci, M.: On the two-dimensional knapsack problem. Oper. Res. Lett. 32, 5–14 (2004)
Caramia, M., Giordan, S., Iovanella, A.: An on-line algorithm for the rectangle packing problem with rejection. In: Proc. WEA. Lecture Notes in Computer Science, vol. 2647, pp. 59–69. Springer, Berlin (2003)
Correa, J.R., Kenyon, C.: Approximation schemes for multidimensional packing. In: SODA, pp. 179–188 (2004)
Epstein, L., van Stee, R.: Online square and cube packing. Acta Inform. 595–606 (2005)
Fishkin, A.V., Gerber, O., Jansen, K., Solis-Oba, R.: Packing weighted rectangles into a square. In: MFCS, pp. 352–363 (2005)
Ferreira, C.E., Miyazawa, E.K., Wakabayashi, Y.: Packing squares into squares. Pesquisa Oper. 19, 223–237 (1999)
Iwama, K., Taketomi, S.: Removable online knapsack problems. In: Proc. ICALP. Lecture Notes in Computer Science, vol. 2380, pp. 293–305. Springer, Berlin (2002)
Jansen, K., Zhang, G.: On rectangle packing: maximizing benefits. In: SODA, pp. 197–206 (2004)
Januszewski, J., Lassak, M.: On-line packing sequences of cubes in the unit cube. Geom. Dedic. 67, 285–293 (1997)
Kohayakawa, Y., Miyazawa, F.K., Raghavan, P., Wakabayashi, Y.: Multidimensional cube packing. Algorithmica 40(3), 173–187 (2004)
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)
Meir, A., Moser, L.: On packing of squares and cubes. J. Comb. Theory 5, 126–134 (1968)
Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. In: ICALP pp. 1111–1122 (2004)
Seiden, S.S., van Stee, R.: New bounds for multidimensional packing. Algorithmica 36, 261–293 (2003)
Yao, A.C.-C.: New algorithms for bin packing. J. ACM 27, 207–227 (1980)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported by NSFC (10231060).
Rights and permissions
About this article
Cite this article
Han, X., Iwama, K. & Zhang, G. Online Removable Square Packing. Theory Comput Syst 43, 38–55 (2008). https://doi.org/10.1007/s00224-007-9039-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-007-9039-0