Name
Abstract | ||
|---|---|---|
In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if the number of different colors is 3. Previously, it has only been known that it is NP-complete, if the number of colors is part of the input and that the problem is solvable in polynomial time, if the number of colors is at most 2. We also show that it is hard to satisfy almost all of the constraints for a feasible instance (even in the restricted case where each interval is used at most once). This implies APX-hardness of maximizing the number of simultaneously satisfiable intervals. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.tcs.2015.04.037 | latin american symposium on theoretical informatics |
Keywords | DocType | Volume |
3-coloring problem,feasible instance,polynomial time,open complexity status,satisfiable interval,different color,fixed number,satisfiability,discrete mathematics | Conference | 593 |
Issue | ISSN | Citations |
C | 0304-3975 | 4 |
PageRank | References | Authors |
0.47 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jaroslaw Byrka | 1 | 523 | 31.45 |
| Andreas Karrenbauer | 2 | 133 | 20.21 |
| Laura Sanità | 3 | 257 | 18.36 |