Abstract
We consider the problem to decompose a binary matrix into a small number of binary matrices whose 1-entries form a rectangle. We show that the linear relaxation of this problem has an optimal integral solution corresponding to a well known geometric result on the decomposition of rectilinear polygons.
| Original language | English |
|---|---|
| Article number | R89 |
| Pages (from-to) | 1-13 |
| Journal | The Electronic Journal of Combinatorics |
| Volume | 16 |
| Issue number | 1 |
| Publication status | Published - 24 Jul 2009 |
Fingerprint
Dive into the research topics of 'A dual of the rectangle-segmentation problem for binary matrices'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver