Abstract
The Cube Packing Problem (CPP) is defined as follows. Find a packing of a given list of (small) cubes into a minimum number of (larger) identical cubes. We show first that the approach introduced by Coppersmith and Raghavan for general online algorithms for packing problems leads to an online algorithm for CPP with asymptotic performance bound 3.954. Then we describe two other offline approximation algorithms for CPP: one with asymptotic performance bound 3.466 and the other with 2.669. A parametric version of this problem is defined and results on online and offline algorithms are presented. We did not find in the literature offline algorithms with asymptotic performance bounds as good as 2.669.
This work has been partially supported by Project ProNEx 107/97 (MCT/FINEP), FAPESP (Proc. 96/4505–2), and CNPq individual research grants (Proc. 300301/98-7 and Proc. 304527/89-0).
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
Baker, B.S., Calderbank, A.R., Coffman Jr., E.G., Lagarias, J.C.: Approximation algorithms for maximizing the number of squares packed into a rectangle. SIAM J. Algebraic Discrete Methods 4(3), 383–397 (1983)
Chung, F.R.K., Garey, M.R., Johnson, D.S.: On packing two-dimensional bins. SIAM J. Algebraic Discrete Methods 3, 66–76 (1982)
Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing – an updated survey. In: Ausiello, G., et al. (eds.) Algorithms design for computer system design, pp. 49–106. Springer, New York (1984)
Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing – a survey. In: Hochbaum, D. (ed.) Approximation algorithms for NP-hard problems, pp. 46–93. PWS (1997)
Coffman Jr., E.G., Lagarias, J.C.: Algorithms for packing squares: A probabilistic analysis. SIAM J. Comput. 18(1), 166–185 (1989)
Coppersmith, D., Raghavan, P.: Multidimensional on-line bin packing: algorithms and worst-case analysis. Oper. Res. Lett. 8(1), 17–20 (1989)
Csirik, J., van Vliet, A.: An on-line algorithm for multidimensional bin packing. Operations Research Letters 13, 149–158 (1993)
Dyckhoff, H., Scheithauer, G., Terno, J.: Cutting and packing. In: Maffioli, F., Dell’Amico, M., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, ch. 22, pp. 393–412. John Wiley, Chichester (1997)
Ferreira, C.E., Miyazawa, F.K., Wakabayashi, Y.: Packing squares into squares. Pesquisa Operacional, a special volume on cutting and packing (to appear)
Li, K., Cheng, K-H.: A generalized harmonic algorithm for on-line multidimensional bin packing. TR UH-CS-90-2, University of Houston (January 1990)
Li, K., Cheng, K.-H.: Generalized first-fit algorithms in two and three dimensions. Int. J. Found. Comput Sci. 1(2), 131–150 (1992)
Meir, A., Moser, L.: On packing of squares and cubes. J. Combinatorial Theory Ser. A 5, 116–127 (1968)
Miyazawa, F.K., Wakabayashi, Y.: Approximation algorithms for the orthogonal z-oriented three-dimensional packing problem. To appear in SIAM J. Computing
Miyazawa, F.K., Wakabayashi, Y.: An algorithm for the three-dimensional packing problem with asymptotic performance analysis. Algorithmica 18(1), 122–144 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miyazawa, F.K., Wakabayashi, Y. (2000). Cube Packing. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_6
Download citation
DOI: https://doi.org/10.1007/10719839_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67306-4
Online ISBN: 978-3-540-46415-0
eBook Packages: Springer Book Archive