Performance bound for bottom-left guillotine packing of rectangles

In this article the authors show that bottom-left guillotine placement of rectangles ordered by decreasing width in a fixed-width bin is not more than three times the height of an optimal placement. This bound is also true for bottom-left placement of rectangles without the guillotine constraints. Thus, bottom-left guillotine placement in which rectangles are ordered by decreasing width has the same worst case performance bound as bottom-left placement of rectangles without guillotine constriants.