This side up!

ACM Transactions on Algorithms

Volumn 2, Issue 2, 2006, Pages 228-243

  Epstein, Leah ^a   Van Stee, Rob ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Bin packing; Online algorithms; Rotations

Indexed keywords

ASYMPTOTIC PERFORMANCE; BIN PACKING; ONLINE ALGORITHMS; ROTATIONS;

ALGORITHMS; ASYMPTOTIC STABILITY; THREE DIMENSIONAL;

PROBLEM SOLVING;

EID: 33747742491     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1150334.1150339     Document Type: Article

References (11)

1. BANSAL, N., AND SVIRIDENKO, M. 2004. New approximability and inapproximability results for 2-dimensional packing. In Proceedings of the 15th ACM/SIAM Annual. Symposium on Discrete Algorithms. ACM/SIAM, New York, 189-196.
2. CAPRARA, A. 2002. Packing 2-dimensional bins in harmony. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 490-499.
3. COFFMAN, E. G., GAREY, M. R., JOHNSON, D. S., AND TARJAN, R. E. 1980. Performance bounds for level oriented two-dimensional packing algorithms. SIAM J. Comput. 9, 808-826.
4. CORREA, J., AND KENYON, C. 2004. Approximation schemes for multidimensional packing. In Proceedings of the 15th ACM/SIAM Symposium on Discrete Algorithms. ACM/SIAM, New York, 179-188.
5. DELL'AMICO, M., MARTELLO, S., AND VIGO, D. 2002. A lower bound for the non-oriented two-dimensional bin packing problem. Disc. Appl. Math. 118, 13-24.
6. EPSTEIN, L. 2003. Two dimensional packing: The power of rotation. In Proceedings of the 28th International Symposium on Mathematical Foundations of Compute r Science (MFCS'2003). 398-407.
7. EPSTEIN, L., AND VAN STEE, R. 2004. Optimal online bounded space multidimensional packing. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '04). ACM/SIAM, New York, 207-216.
8. FUJITA, S., AND HADA, T. 2002. Two-dimensional on-line bin packing problem with rotatable items. Theoret. Comput. Sci. 289, 2, 939-952.
9. Li, K., AND CHENG, K.-H. 1990. Static job scheduling in partitionable mesh connected systems. J. Paral. Distrib. Comput. 10, 152-159.
10. MIYAZAWA, F. K., AND WAKABAYASHI, Y. 2000. Approximation algorithms for the orthogonal z-oriented 3-d packing problem. SIAM J. Comput. 29, 3, 1008-1029.
11. MIYAZAWA, F. K., AND WAKABAYASHI, Y. 2004. Packing problems with orthogonal rotations. In Theoretical Informatics, 6th Latin American Symposium, M. Farach-Colton, Ed. Number 2976 Lecture Notes in Computer Science, vol. 2976. Springer-Verlag, New York, 359-368.