Harmonic algorithm for 3-dimensional strip packing problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 1197-1206

  Bansal, Nikhil ^a   Han, Xin ^b   Iwama, Kazuo ^b   Sviridenko, Maxim ^a   Zhang, Guochuan ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b KYOTO UNIVERSITY   (Japan)

^c ZHEJIANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINS;

3-DIMENSIONAL; BIN PACKING; BIN PACKING PROBLEM; HARMONIC NUMBER; PERFORMANCE GUARANTEES; STRIP PACKING PROBLEM; WORST-CASE PERFORMANCE;

APPROXIMATION ALGORITHMS;

EID: 84969132857     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. B. S. Baker, E. G. Coffman and R. L. Rivest, Orthogonal packings in two dimensions. SIAM J. Comput. 9(1980), 846-855.
2. N. Bansal, A. Caprara and M. Sviridenko. Improved approximation algorithms for multidimensional bin packing problems. Foundations of Computer Science 2006, to appear.
3. N. Bansal, J. Correa, C. Kenyon and M. Sviridenko, Bin packing in multiple dimensions: inapproximability results and approximation schemes. Math. Oper. Res. 31 (2006), no. 1, 31-49.
4. A. Caprara. Packing two-dimensional bins in harmony. In Proceeding of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), 490-499, 2002.
5. E. G. Coffman, M. R. Garey, D. S. Johnson and R. E. Tarjan. Performance bounds for level-oriented two dimensional packing algorithms. SIAM J. Computing 9 (1980), 802-826.
6. W. Fernandez de la Vega and G. S. Lueker. Bin packing can be solved within 1+epsilon in linear time. Combinatorica 1 (1981), 349-355.
7. K. Jansen and R. Solis-Oba. An asymptotic approximation algorithm for 3D-strip packing. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), Miami, Florida, USA, January 22-24, 2006.
8. N. Karmarkar and R. M. Karp. An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem. Proceedings of Foundations of Computer Science 1982, 312-320.
9. C. Kenyon and E. Rémila. A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem. Mathematics of Operations Research 25 (2000), 645-656.
10. K. Li and K. Cheng. On three-dimensional packing. SIAM J. Comput. 19 (1990), no. 5, 847-867.
11. K. Li and K. Cheng. Heuristic algorithms for on-line packing in three dimensions. J. Algorithms 13 (1992), no. 4, 589-605.
12. C. Lee and D. Lee. A simple on-line bin-packing algorithm. J. Assoc. Comput. Mach. 32 (1985), no. 3, 562-572.
13. A. Meir and L. Moser, On packing of squares and cubes, Journal of combinatorial theory 5:126-134, 1968.
14. F. Miyazawa and Y. Wakabayashi. An algorithm for the three-dimensional packing problem with asymptotic performance analysis. Algorithmica 18 (1997), no. 1, 122-144.
15. F. Miyazawa and Y. Wakabayashi. Packing problems with orthogonal rotations. LATIN 2004: Theoretical informatics, 359-368, Lecture Notes in Comput. Sci., 2976, Springer, Berlin, 2004.