A dual of the rectangle-segmentation problem for binary matrices (Q2380244)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5686792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dual of the rectangle-segmentation problem for binary matrices |
scientific article; zbMATH DE number 5686792 |
Statements
A dual of the rectangle-segmentation problem for binary matrices (English)
0 references
26 March 2010
0 references
Summary: 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.
0 references
0.8624975681304932
0 references
0.7553402185440063
0 references
0.7404817938804626
0 references
0.737567126750946
0 references
0.7356052398681641
0 references
