### Abstract

We consider the problem of partitioning (in a certain manner) a rectangle into n regions of equal area so that the total lengths of the boundaries is a minimum. A closed form solution to the problem is presented.

Original language | English (US) |
---|---|

Pages (from-to) | 305-324 |

Number of pages | 20 |

Journal | Discrete Mathematics |

Volume | 36 |

Issue number | 3 |

DOIs | |

State | Published - 1981 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'Minimum cost partitions of a rectangle'. Together they form a unique fingerprint.

## Cite this

Wachs, M. L. (1981). Minimum cost partitions of a rectangle.

*Discrete Mathematics*,*36*(3), 305-324. https://doi.org/10.1016/S0012-365X(81)80026-X