Proceedings of 37th Conference on Foundations of Computer Science (1996)

Burlington, VT

Oct. 14, 1996 to Oct. 16, 1996

ISBN: 0-8186-7594-2

pp: 31

C. Kenyon , LIP, Ecole Normale Superieure de Lyon, France

E. Remila , LIP, Ecole Normale Superieure de Lyon, France

ABSTRACT

We present an approximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm finds a packing of n rectangles whose total height is within a factor of (1+/spl epsiv/) of optimal, and has running time polynomial both in n and in 1//spl epsiv/. It is based on a reduction to fractional bin-packing, and can be performed by 5 stages of guillotine cuts.

INDEX TERMS

computational complexity; strip-packing; packing rectangles; NP-hard cutting-stock problem; fractional bin-packing; guillotine cuts

CITATION

E. Remila and C. Kenyon, "Approximate strip packing,"

*Proceedings of 37th Conference on Foundations of Computer Science(FOCS)*, Burlington, VT, 1996, pp. 31.

doi:10.1109/SFCS.1996.548461

CITATIONS