A note on one-space bounded square packing

• We study the problem of online packing of squares into bins with only one active bin.
• We describe a new one-space bounded packing algorithm.
• We improve upper bounds of the previous online one-space bounded algorithms: a 4.5-competitive algorithm from 2010 (Chen et al.) and a 4.3-competitive algorithm from 2013 (Chin et al.).

A 3.883-competitive online square packing algorithm with one active bin is described.