On the Approximability of the Maximum Interval Constrained Coloring Problem
From MaRDI portal
Publication:3060771
DOI10.1007/978-3-642-17514-5_15zbMath1310.68236OpenAlexW1567036572MaRDI QIDQ3060771
Rajiv Raman, Amr Elmasry, Stefan Canzar, Khaled M. Elbassioni
Publication date: 9 December 2010
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17514-5_15
Biochemistry, molecular biology (92C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
On the approximability of the maximum interval constrained coloring problem ⋮ The interval constrained 3-coloring problem
