Geodesic
A dual of the rectangle-segmentation problem for binary matrices
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/178
Classification : 90C27, 90C46 
@article{10_37236_178,
     author = {Thomas Kalinowski},
     title = {A dual of the rectangle-segmentation problem for binary matrices},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/178},
     zbl = {1189.90131},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/178/}
}
TY  - JOUR
AU  - Thomas Kalinowski
TI  - A dual of the rectangle-segmentation problem for binary matrices
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/178/
DO  - 10.37236/178
ID  - 10_37236_178
ER  - 
%0 Journal Article
%A Thomas Kalinowski
%T A dual of the rectangle-segmentation problem for binary matrices
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/178/
%R 10.37236/178
%F 10_37236_178
Thomas Kalinowski. A dual of the rectangle-segmentation problem for binary matrices. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/178

Cité par Sources :