On packing squares into a rectangle

Authors:
Stefan Hougardy
Affiliations:
Research Institute for Discrete Mathematics, University of Bonn, Lennéstr. 2, 53113 Bonn, Germany
Venue:
Computational Geometry: Theory and Applications
Year:
2011

Citing 6
Cited 1

Packing squares into a square

Journal of Parallel and Distributed Computing
Problems, problems, problems

Discrete Applied Mathematics
An O-tree representation of non-slicing floorplan and its applications

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Exhaustive approaches to 2D rectangular perfect packings

Information Processing Letters
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes

Mathematics of Operations Research
An optimal bound for two dimensional bin packing

SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science

Rectangle packing with additional restrictions

Theoretical Computer Science

Quantified Score

Hi-index	0.02

Visualization

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...@?. This improves on the previous best bound of 1.53. Also, our proof yields a linear time algorithm for finding such a packing.