| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 414824 | Computational Geometry | 2011 | 8 Pages |
Abstract
We prove that every set of squares with total area 1 can be packed into a rectangle of area at most 2867/2048=1.399…2867/2048=1.399… . This improves on the previous best bound of 1.53. Also, our proof yields a linear time algorithm for finding such a packing.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Stefan Hougardy,