Abstract
In this extended abstract, we present approximation algorithms for the following packing problems: the strip packing problem, the two-dimensional bin packing problem, the three-dimensional strip packing problem, and the three-dimensional bin packing problem. For all these problems, we consider orthogonal packings where 90° rotations are allowed. The algorithms we show for these problems have asymptotic performance bounds 1.613, 2.64, 2.76 and 4.89, respectively. We also present an algorithm for the z-oriented three-dimensional packing problem with asymptotic performance bound 2.64. To our knowledge the bounds presented here are the best known for each problem.
This work has been partially supported by MCT /CNPq – Project ProNEx (Proc. 664107/97-4), and CNPq (Proc. 300301/98-7, 304527/89–0, 464114/00–4, 470608/01–3, 478818/03–3).
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., Coffman Jr., E.G., Rivest, R.L.: Orthogonal packings in two-dimensions. SIAM Journal on Computing 9, 846–855 (1980)
Chung, F.R.K., Garey, M.R., Johnson, D.S.: On packing two-dimensional bins. SIAM Journal on Algebraic and 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., Lucertini, M., Serafini, P. (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. PWS (1997)
Coffman Jr., E.G., Garey, M.R., Johnson, D.S., Tarjan, R.E.: Performance bounds for level oriented two-dimensional packing algorithms. SIAM J. on Computing 9, 808–826 (1980)
Fernandez de la Vega, W., Lueker, G.S.: Bin packing can be solved within 1 + ε in linear time. Combinatorica 1(4), 349–355 (1981)
Johnson, D.S.: Near-optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology, Cambridge, Mass (1973)
Kenyon, C., Remila, E.: Approximate strip packing. In: 37th Annual Symposium on Foundations of Computer Science, pp. 31–36 (1996)
Li, K., Cheng, K.-H.: Static job scheduling in partitionable mesh connected systems. Journal of Parallel and Distributed Computing 10, 152–159 (1990)
Miyazawa, F.K., Wakabayashi, Y.: An algorithm for the three-dimensional packing problem with asymptotic performance analysis. Algorithmica 18(1), 122–144 (1997)
Miyazawa, F.K., Wakabayashi, Y.: Approximation algorithms for the orthogonal z-oriented 3-D packing problem. SIAM Journal on Computing 29(3), 1008–1029 (2000)
Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miyazawa, F.K., Wakabayashi, Y. (2004). Packing Problems with Orthogonal Rotations. In: Farach-Colton, M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24698-5_40
Download citation
DOI: https://doi.org/10.1007/978-3-540-24698-5_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21258-4
Online ISBN: 978-3-540-24698-5
eBook Packages: Springer Book Archive