The interval constrained 3-coloring problem

DOI10.1016/J.TCS.2015.04.037MaRDI QIDQ500992zbMATH OpenOpenAlexFDO

Authors Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità

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)

Recommendations

• The interval constrained 3-coloring problem
• On the approximability of the maximum interval constrained coloring problem
• Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
• Deconstructing Intractability: A Case Study for Interval Constrained Coloring
• Approximating the Interval Constrained Coloring Problem

Cites work

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

Cited in

(7)

• On the approximability of the maximum interval constrained coloring problem
• Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
• On the approximability of the maximum interval constrained coloring problem
• 3-coloring arrangements of line segments with 4 slopes is hard
• Deconstructing Intractability: A Case Study for Interval Constrained Coloring
• Choice is hard
• The interval constrained 3-coloring problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q500992)