Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/26801| Title: | A dual of the rectangle-segmentation problem for binary matrices | Contributor(s): | Kalinowski, Thomas (author) |
Publication Date: | 2009-07-24 | Open Access: | Yes | Handle Link: | https://hdl.handle.net/1959.11/26801 | Open Access Link: | https://www.combinatorics.org/ojs/index.php/eljc/article/view/v16i1r89/pdf |
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. | Publication Type: | Journal Article | Source of Publication: | The Electronic Journal of Combinatorics, 16(1), p. 1-13 | Publisher: | Electronic Journal of Combinatorics | Place of Publication: | United States of America | ISSN: | 1077-8926 | Fields of Research (FoR) 2008: | 010104 Combinatorics and Discrete Mathematics (excl. Physical Combinatorics) 010303 Optimisation |
Socio-Economic Objective (SEO) 2008: | 970101 Expanding Knowledge in the Mathematical Sciences | Peer Reviewed: | Yes | HERDC Category Description: | C1 Refereed Article in a Scholarly Journal | Publisher/associated links: | https://www.combinatorics.org/ojs/index.php/eljc/article/view/v16i1r89 |
|---|---|
| Appears in Collections: | Journal Article School of Science and Technology |
Files in This Item:
| File | Size | Format |
|---|
Page view(s)
1,318
checked on Mar 8, 2023
Download(s)
2
checked on Mar 8, 2023
This item is licensed under a Creative Commons License
