This paper solves the problem of subdividing a unit square into p rectangles of area 1/p in such a way that the maximal perimeter of a rectangle is as small as possible. The correctness of the solution is proved using the well-known theorems of Menger and Dilworth.
Bibliographical noteFunding Information:
* Permanent address: Department of Computer Science, Ohio University, Athens, Ohio 45701. ** The support of the Air Force Office of Scientific Research under Contract F-49620-85-K-0009 is gratefully acknowledged. *** Permanent address: Department of Computer Science, The Hebrew University of Jerusalem, 91904 Jerusalem, Israel.