Name
Abstract | ||
|---|---|---|
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. 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 >= 7 the problem is NP-hard. Afterward Chrobak and Durr improved this result; by proving that it remains NP-hard for k >= 4. We solve the gap by showing that for 3 colors the problem is already NP-hard. Besides we also give some results on tiling tomography. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-04128-0_69 | ALGORITHMS - ESA 2009, PROCEEDINGS |
Keywords | DocType | Volume |
computational complexity,data structure | Journal | 5757 |
ISSN | Citations | PageRank |
0302-9743 | 16 | 1.29 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christoph Dürr | 1 | 592 | 74.64 |
| F. Guíñez | 2 | 40 | 4.17 |
| Martín Matamala | 3 | 158 | 21.63 |