An approximation algorithm for square packing

Operations Research Letters

Volumn 32, Issue 6, 2004, Pages 535-539

  Van Stee, Rob ^a  

^a CWI   (Netherlands)

Author keywords

Absolute worst case ratio; Approximation algorithm; Bin packing; Square packing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

ABSOLUTE WORST-CASE RATIO; APPROXIMATION ALGORITHM; BIN PACKING; SQUARE PACKING;

OPERATIONS RESEARCH;

EID: 3042857274     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.02.003     Document Type: Article

References (15)

1. Nikhil Bansal, Maxim Sviridenko, New approximability and inapproximability results for 2-dimensional packing, Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM/SIAM, 2004, pp. 189-196.
2. Alberto Caprara, Packing 2-dimensional bins in harmony, Proceedings of the 43th IEEE Symposium on Foundations of Computer Science, 2002, pp. 490-499.
3. R.K. Chung Fan, R. Garey Michael, S. Johnson David On packing two-dimensional bins. SIAM Journal on Algebraic and Discrete Methods. 3:1982;66-76.
4. Edward G. Coffman, Michael R. Garey, David S. Johnson, Approximation algorithms for bin packing: a survey, in: D. Hochbaum (Ed.), Approximation Algorithms, PWS Publishing Company, 1997.
5. Jose Correa, Claire Kenyon, Approximation schemes for multidimensional packing, Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM/SIAM, 2004, pp. 179-188.
6. János Csirik, Gerhard J. Woeginger, On-line packing and covering problems, in: A. Fiat, G.J. Woeginger (Eds.), Online Algorithms: The State of the Art, Lecture Notes in Computer Science, Vol. 1442, Springer-Verlag, 1998, pp. 147-177.
7. Fernandez de la Vega Wenceslas, S. Lueker George Bin packing can be solved within. 1+ε in linear time Combinatorica. 1:1981;349-355.
8. E. Ferreira Carlos, K. Miyazawa Flavio, Wakabayashi Yoshiko Packing squares into squares. Pesquisa Operacional. 19(2):1999;223-237.
9. Michael R. Garey, Ronald L. Graham, Jeffrey D. Ullman, Worst-case analysis of memory allocation algorithms, Proceedings of the Fourth Annual ACM Symposium on Theory of Computing, ACM, 1972, pp. 143-150.
10. Narendra Karmarkar, Richard M. Karp, An efficient approximation scheme for the one-dimensional bin-packing problem, Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982, pp. 312-320.
11. Leung J.Y.T., Lam T.W., Wong C.S., Young G.H., Chin F.Y.L. Packing squares into a square. Journal on Parallel and Distributed Computing. 10:1990;271-275.
12. Meir A., Moser L. On packing of squares and cubes. Journal of Combinatorial Theory. 5:1968;126-134.
13. Ingo Schiermeyer, Reverse-fit: a 2-optimal algorithm for packing rectangles, Algorithms - ESA'94, Proceedings Second Annual European Symposium, 1994, pp. 290-299.
14. S. Seiden Steve, van Stee Rob New bounds for multi-dimensional packing. Algorithmica. 36(3):2003;261-293.
15. Steinberg A. A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing. 26(2):1997;401-409.