| Title |
|
A dual of the rectangle-segmentation problem for binary matrices |
|
|
| Publication Date |
|
| Author(s) |
|
| Type of document |
|
| Language |
|
| Entity Type |
|
| Publisher |
|
Electronic Journal of Combinatorics |
|
|
| Place of publication |
|
| UNE publication id |
|
| 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. |
|
|
| Link |
|
| Citation |
|
The Electronic Journal of Combinatorics, 16(1), p. 1-13 |
|
|
| ISSN |
|
| Start page |
|
| End page |
|
| Rights |
|
Attribution-NonCommercial-NoDerivatives 4.0 International |
|
|