Abstract
We show that the way to partition a unit square into k2+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.
Original language | English (US) |
---|---|
Pages (from-to) | 111-119 |
Number of pages | 9 |
Journal | Discrete Mathematics |
Volume | 103 |
Issue number | 2 |
DOIs | |
State | Published - May 27 1992 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics