Name
Abstract | ||
|---|---|---|
We show that the way to partition a unit square into k 2 + s rectangles, for s =1 or s =-1, so as to minimize the largest perimeter of the rectangles, is to have k −1 rows of k identical rectangles and one row of k + s identical rectangles, with all rectangles having the same perimeter. We also consider the analogous problem for partitioning a rectangle into n rectangles and describe some possible approaches to it. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0012-365X(92)90261-D | Discrete Mathematics |
Keywords | Field | DocType |
small perimeter rectangle | Row,Discrete mathematics,Combinatorics,Rectangle,Perimeter,Unit square,Partition (number theory),Mathematics,Rectangle method | Journal |
Volume | Issue | ISSN |
103 | 2 | Discrete Mathematics |
Citations | PageRank | References |
2 | 0.50 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Noga Alon | 1 | 10468 | 1688.16 |
| Daniel J. Kleitman | 2 | 854 | 277.98 |