Abstract
We describe and analyze a ”level-oriented” algorithm, called ”Reverse-Fit”, for packing rectangles into a unit-width, infinite-height bin so as to minimize the total height of the packing. For L an arbitrary list of rectangles, all assumed to have width no more than 1, let h OPT denote the minimum possible bin height within the rectangles in L can be packed, and let RF(L) denote the height actually used by Reverse-Fit. We will show that RF(L)≤2·h OPT for an arbitrary list L of rectangles.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
B. S. Baker, E. G. Coffman, Jr. and R. L. Rivest, Orthogonal packings in two dimensions, SIAM J. Comput., Vol. 9, No. 4 (1980) 846–855.
P. Brucker and M. Grötschel, personal communication, January 1994.
E. G. Coffman, Jr., M. R. Garey, D. S. Johnson and R. E. Tarjan, Performance bounds for level-oriented two-dimensional packing algorithms, SIAM J. Comput., Vol. 9, No. 4 (1980) 808–826.
M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, 1979.
D. D. K. D. B. Sleator, A 2.5 times optimal algorithm for packing in two dimensions, Inform. Process. Lett. 10, no. 1 (1980) 37–40.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schiermeyer, I. (1994). Reverse-Fit: A 2-optimal algorithm for packing rectangles. In: van Leeuwen, J. (eds) Algorithms — ESA '94. ESA 1994. Lecture Notes in Computer Science, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049416
Download citation
DOI: https://doi.org/10.1007/BFb0049416
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58434-6
Online ISBN: 978-3-540-48794-4
eBook Packages: Springer Book Archive