A dual of the rectangle-segmentation problem for binary matrices (Q2380244): Difference between revisions
From MaRDI portal
Created a new Item |
Import IPFS CIDs |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / IPFS content identifier | |||
| Property / IPFS content identifier: bafkreigryujxfnuxnrmytmslmfw2xsycozzwvti7v5esvf5v2zyoezreai / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:44, 22 February 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dual of the rectangle-segmentation problem for binary matrices |
scientific article |
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
