An approximation scheme for strip packing of rectangles with bounded dimensions

Discrete Applied Mathematics

Volumn 82, Issue 1-3, 1998, Pages 93-101

  Fernandez De La Vega, W ^a   Zissimopoulos, V ^a  

^a CNRS   (France)

Author keywords

Approximation algorithms; Strip packing

Indexed keywords

EID: 0042353771     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-218x(97)00130-3     Document Type: Article

References (10)

1. B.S. Baker, D.J. Brown, H.P. Katseff, A 5/4 algorithm for two-dimensional packing, J. Algorithms 2 (1981) 348-368.
2. B.S. Baker, E.G. Coffman, R.L. Rivest, Orthogonal packings in two dimensions. SIAM J. Comput. 9 (4) (1980) 846-855.
3. M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, R.E. Tarjan. Time bounds for selection, J. Comput. System Sci. 7 (1973) 448-461.
4. E.G. Coffman, M.R. Garey, D.S. Johnson, R.E. Tarjan, Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Comput. 9 (4) (1980) 808-826.
5. W. Fernandez de la Vega, G.S. Lueker, Bin packing can be solved within 1 + ε in linear time, Combinatorica 1 (4) (1981) 349-355.
6. I. Golan, Orthogonal oriented algorithms for packing in two dimensions, draft, 1978.
7. D.S. Johnson, The NP-completeness column: an ongoing guide, J. Algorithms 3 (3) (1982) 288-300.
8. N. Karmarkar, R.M. Karp, An efficient approximation scheme for the one-dimensional bin-packing problem, 22nd Symp. on the Foundations of Computer Science, 1982, pp. 312-320.
9. C. Kenyon, E. Rémila, Approximate strip packing, 37th Symp. on the Foundations of Computer Science, 1996.
10. H.W. Lenstra, Integer programming with a fixed number of variables, Math. Oper. Res 8 (4) (1983) 538-548.