A Strip-Packing Algorithm with Absolute Performance Bound 2
SIAM Journal on Computing
Packing 2-Dimensional Bins in Harmony
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Mathematics of Operations Research
Harmonic algorithm for 3-dimensional strip packing problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Packing d-Dimensional Bins in d Stages
Mathematics of Operations Research
Hardness of approximation for orthogonal rectangle packing and covering problems
Journal of Discrete Algorithms
Two for One: Tight Approximation of 2D Bin Packing
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A polynomial time approximation scheme for the square packing problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Communications of the ACM
Puzzled: Solutions and sources
Communications of the ACM
SIAM Journal on Computing
A (5/3 + ε)-approximation for strip packing
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
| Hi-index | 0.00 |
Let S be a set of n points in the unit square [0, 1]2, one of which is the origin. We construct n pairwise interior-disjoint axis-aligned empty rectangles such that the lower left corner of each rectangle is a point in S, and the rectangles jointly cover at least a positive constant area (about 0.09). This is a first step towards the solution of a longstanding conjecture that the rectangles in such a packing can jointly cover an area of at least 1/2.