The Interval Constrained 3-Coloring Problem

@inproceedings{Byrka2010TheIC,
  title={The Interval Constrained 3-Coloring Problem},
  author={Jaroslaw Byrka and Andreas Karrenbauer and Laura Sanit{\`a}},
  booktitle={LATIN},
  year={2010}
}
  • Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità
  • Published in LATIN 2010
  • Computer Science, Mathematics
  • 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. This… CONTINUE READING

    Figures and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-8 OF 8 CITATIONS

    Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring

    VIEW 16 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Reflections on Multivariate Algorithmics and Problem Parameterization

    VIEW 4 EXCERPTS
    CITES BACKGROUND & RESULTS
    HIGHLY INFLUENCED

    References

    Publications referenced by this paper.
    SHOWING 1-9 OF 9 REFERENCES

    Optimization, Approximation, and Complexity Classes

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    On the Complexity of Timetable and Multicommodity Flow Problems

    VIEW 1 EXCERPT

    The PCP theorem by gap amplification

    • Irit Dinur
    • Mathematics, Computer Science
    • STOC '06
    • 2006
    VIEW 2 EXCERPTS