AbstractWe 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
We provide a tight result for a fundamental problem arising from packing squares into a circular con...
noneWhat is the smallest rectangle that can hold squares of sizes 1 to n? This problem is unsolved f...
The rectangle-packing problem consists of finding an enclosing rectangle of smallest area that can co...
AbstractWe prove that every set of squares with total area 1 can be packed into a rectangle of area ...
AbstractThis paper improves the previous bound (Jennings, in press), from 133132 to 204203, concerni...
AbstractIn this paper it is proved that all the squares of size, 12n+1, n = 1,2,3,…, can be packed i...
AbstractAn algorithm is presented that can be used to pack sets of squares (or rectangles) into rect...
AbstractThis paper improves the bound, due to D. Jennings [J. Combin. Theory Ser. A68(1994), 465–469...
It is known that ∑i=1∞1/i2=π2/6. Meir and Moser asked what is the smallest ϵ such that all the squar...
We present new results on the problem of finding an enclos-ing rectangle of minimum area that will c...
AbstractAn interesting problem is to determine whether all the squares of side n−1 can be packed int...
For points p_1,...,p_n in the unit square [0,1]^2, an anchored rectangle packing consists of interio...
AbstractMoser asked whether the collection of rectangles of dimensions 1×12, 12×13, 13×14, …, whose ...
AbstractThis paper improves a previous bound, due to Meir and Moser in [J. Combin. Theory5 (1968), 1...
We study an interesting geometric optimization problem. We are given a set of rectangles and a recta...
We provide a tight result for a fundamental problem arising from packing squares into a circular con...
noneWhat is the smallest rectangle that can hold squares of sizes 1 to n? This problem is unsolved f...
The rectangle-packing problem consists of finding an enclosing rectangle of smallest area that can co...
AbstractWe prove that every set of squares with total area 1 can be packed into a rectangle of area ...
AbstractThis paper improves the previous bound (Jennings, in press), from 133132 to 204203, concerni...
AbstractIn this paper it is proved that all the squares of size, 12n+1, n = 1,2,3,…, can be packed i...
AbstractAn algorithm is presented that can be used to pack sets of squares (or rectangles) into rect...
AbstractThis paper improves the bound, due to D. Jennings [J. Combin. Theory Ser. A68(1994), 465–469...
It is known that ∑i=1∞1/i2=π2/6. Meir and Moser asked what is the smallest ϵ such that all the squar...
We present new results on the problem of finding an enclos-ing rectangle of minimum area that will c...
AbstractAn interesting problem is to determine whether all the squares of side n−1 can be packed int...
For points p_1,...,p_n in the unit square [0,1]^2, an anchored rectangle packing consists of interio...
AbstractMoser asked whether the collection of rectangles of dimensions 1×12, 12×13, 13×14, …, whose ...
AbstractThis paper improves a previous bound, due to Meir and Moser in [J. Combin. Theory5 (1968), 1...
We study an interesting geometric optimization problem. We are given a set of rectangles and a recta...
We provide a tight result for a fundamental problem arising from packing squares into a circular con...
noneWhat is the smallest rectangle that can hold squares of sizes 1 to n? This problem is unsolved f...
The rectangle-packing problem consists of finding an enclosing rectangle of smallest area that can co...
DOI
Add to ORKG