Minimum decomposition into convex binary matrices

Motivated by Intensity Modulated Radiation Therapy, we consider the problem of the minimum decomposition of an integer matrix into hv-convex matrices with time and cardinality objectives. We study the special case where the matrix to decompose is a binary matrix (in this case, time decomposition and...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 160; no. 7-8; pp. 1164 - 1175
Main Authors Jarray, Fethi, Picouleau, Christophe
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.05.2012
Elsevier
Subjects
[formula omitted]-complete
Combinatorics
Computer Science
Convex polyomino
Data Structures and Algorithms
Discrete Mathematics
Intensity Modulated Radiation Therapy
Mathematics
Matrix decomposition
Convex polyomino
NP-complete
Matrix decomposition
Intensity Modulated Radiation Therapy
Online AccessGet full text

Cover

More Information
Summary:Motivated by Intensity Modulated Radiation Therapy, we consider the problem of the minimum decomposition of an integer matrix into hv-convex matrices with time and cardinality objectives. We study the special case where the matrix to decompose is a binary matrix (in this case, time decomposition and cardinality decomposition are the same). We prove that the decomposition into two hv-convex matrices or into two hv-convex polyominoes is polynomially solvable. For the decomposition into three hv-convex matrices the problem becomes NP-complete.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2012.01.013