Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing

Arindam Khan, Aditya Lonkar, Arnab Maiti +2

In the Strip Packing problem (SP), we are given a vertical half-strip $[0,W]\times [0,\infty )$ and a set of $n$ axis-aligned rectangles of width at most $W$. The goal is to find a n…