The interval constrained 3-coloring problem

DOI10.1016/j.tcs.2015.04.037zbMath1330.68104OpenAlexW1584364430MaRDI QIDQ500992

Laura Sanità, Jaroslaw Byrka, Andreas Karrenbauer

Publication date: 8 October 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.04.037

zbMATH Keywords

APX-hardnessinterval constrained coloring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Approximation algorithms for the interval constrained coloring problem
• Optimization, approximation, and complexity classes
• On the Approximability of the Maximum Interval Constrained Coloring Problem
• Approximating the Interval Constrained Coloring Problem
• Dependent rounding and its applications to approximation algorithms
• The Interval Constrained 3-Coloring Problem
• Deconstructing Intractability: A Case Study for Interval Constrained Coloring
• On the Complexity of Timetable and Multicommodity Flow Problems
• A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem
• The PCP theorem by gap amplification

This page was built for publication: The interval constrained 3-coloring problem