Improved Pseudo-Polynomial-Time Approximation for Strip Packing

@inproceedings{Glvez2016ImprovedPA,
  title={Improved Pseudo-Polynomial-Time Approximation for Strip Packing},
  author={Waldo G{\'a}lvez and Fabrizio Grandoni and Salvatore Ingala and Arindam Khan},
  booktitle={FSTTCS},
  year={2016}
}
We study the strip packing problem, a classical packing problem which generalizes both bin packing and makespan minimization. Here we are given a set of axis-parallel rectangles in the two-dimensional plane and the goal is to pack them in a vertical strip of fixed width such that the height of the obtained packing is minimized. The packing must be non-overlapping and the rectangles cannot be rotated. A reduction from the partition problem shows that no approximation better than 3/2 is possible… CONTINUE READING

3 Figures & Tables

Topics

Statistics

0102020172018
Citations per Year

Citation Velocity: 6

Averaging 6 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.