Location of Repository

Email: kenyon @ 1ip.ens-lyon.fr

By Claire Kenyon

Abstract

We present an qpproximation 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 find,!; a packing of n rectangles whose total height is within a,factor of (1 + E) of optimal, and has running time polynomial both in n and in 1 / E. It is based on a reduction to fractional bin-packing, and can be peqormed by 5 stages of guilhtine cuts

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.186.4777
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.brown.edu/resear... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.