@article{Adamaszek2017HardnessOA,
title={Hardness of Approximation for Strip Packing},
author={A. Adamaszek and Tomasz Kociumaka and Marcin Pilipczuk and Michal Pilipczuk},
journal={ACM Trans. Comput. Theory},
year={2017},
volume={9},
pages={14:1-14:7}
}

Strip packing is a classical packing problem, where the goal is to pack a set of rectangular objects into a strip of a given width, while minimizing the total height of the packing. The problem has multiple applications, for example, in scheduling and stock-cutting, and has been studied extensively.
When the dimensions of the objects are allowed to be exponential in the total input size, it is known that the problem cannot be approximated within a factor better than 3/2, unless P= NP. However… Expand