| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428849 | Information Processing Letters | 2015 | 5 Pages |
Abstract
•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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Paulina Grzegorek, Janusz Januszewski,