On the Approximability of the Maximum Interval Constrained Coloring Problem

Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman. On the Approximability of the Maximum Interval Constrained Coloring Problem. In Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park, editors, Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II. Volume 6507 of Lecture Notes in Computer Science, pages 168-179, Springer, 2010. [doi]

@inproceedings{CanzarEER10,
  title = {On the Approximability of the Maximum Interval Constrained Coloring Problem},
  author = {Stefan Canzar and Khaled M. Elbassioni and Amr Elmasry and Rajiv Raman},
  year = {2010},
  doi = {10.1007/978-3-642-17514-5_15},
  url = {http://dx.doi.org/10.1007/978-3-642-17514-5_15},
  researchr = {https://researchr.org/publication/CanzarEER10},
  cites = {0},
  citedby = {0},
  pages = {168-179},
  booktitle = {Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II},
  editor = {Otfried Cheong and Kyung-Yong Chwa and Kunsoo Park},
  volume = {6507},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-17513-8},
}