On the approximability of the maximum interval constrained coloring problem

Canzar, 2010, On the approximability of the maximum interval constrained coloring problem, vol. 6507, 168 Ernst Althaus, Stefan Canzar, Khaled Elbassioni, Andreas Karrenbauer, Julián Mestre, Approximating the interval constrained coloring problem, in: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory, 2008, pp. 210–221. Althaus, 2008, Computing h/d-exchange speeds of single residues from data of peptic fragments, 1273 Jarek Byrka, Andreas Karrebauer, Laura Sanità, Hardness of interval constrained coloring, in: Proceedings of the 9th Latin American Theoretical Informatics Symposium, 2009. Elbassioni, 2009, On the approximability of the maximum feasible subsystem problem with 0/1-coefficients, 1210 Dilworth, 1950, A decomposition theorem for partially ordered sets, Ann. of Math., 51, 161, 10.2307/1969503 Ernst Althaus, Stefan Canzar, Carsten Ehrler, Mark R. Emmett, Andreas Karrenbauer, Alan G. Marshall, Anke Meyer-Bäse, Jeremiah Tipton, Huimin Zhang, Discrete fitting of hydrogen-deuterium-exchange-data of overlapping fragments, in: Proceedings of the 4th International Conference on Bioinformatics & Computational Biology, 2009, pp. 23–30. Canzar, 2010, A polynomial delay algorithm for enumerating approximate solutions to the interval constraint coloring problem Komusiewicz, 2009, Deconstructing intractability: a case study for interval constrained coloring, vol. 5577, 207 de Werra, 2008, On the use of graphs in discrete tomography, 4OR, 6, 101, 10.1007/s10288-008-0077-5 Bentz, 2008, On a graph coloring problem arising from discrete tomography, Networks, 51, 256, 10.1002/net.20218 Albertson, 1989, The subchromatic number of a graph, Discrete Math., 74, 33, 10.1016/0012-365X(89)90196-9 Schrijver, 2003 Håstad, 2001, Some optimal inapproximability results, J. ACM, 48, 798, 10.1145/502090.502098