Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Discrete Mathematics Année : 2012

Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography

Christoph Dürr
Flavio Guíñez
  • Fonction : Auteur
Martín Matamala
  • Fonction : Auteur

Résumé

We consider the problem of coloring a grid using k colors with the restriction that each row and each column has a specific number of cells of each color. This problem has been known as the $(k-1)$-atom problem in the discrete tomography community. In an already classical result, Ryser obtained a necessary and sufficient condition for the existence of such a coloring when two colors are considered. This characterization yields a linear time algorithm for constructing such a coloring when it exists. Gardner et al. showed that for $k\geqslant 7$ the problem is NP-hard. Afterward Chrobak and Dürr improved this result by proving that it remains NP-hard for $k\geqslant 4$. We close the gap by showing that for $k=3$ colors the problem is already NP-hard. In addition, we give some results on tiling tomography problems.
Fichier non déposé

Dates et versions

hal-01185264 , version 1 (19-08-2015)

Identifiants

Citer

Christoph Dürr, Flavio Guíñez, Martín Matamala. Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography. SIAM Journal on Discrete Mathematics, 2012, 26 (1), pp.330-352. ⟨10.1137/100799733⟩. ⟨hal-01185264⟩
77 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More