de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

On the Approximability of the Maximum Interval Constrained Coloring Problem

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44218

Canzar,  Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44374

Elbassioni,  Khaled
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44380

Elmasry,  Amr
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45251

Raman,  Rajiv
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Canzar, S., Elbassioni, K., Elmasry, A., & Raman, R. (2010). On the Approximability of the Maximum Interval Constrained Coloring Problem. In O. Cheong, K.-Y. Chwa, & K. Park (Eds.), Algorithms and Computation (pp. 168-179). Berlin: Springer. doi:10.1007/978-3-642-17514-5_15.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-1698-7
Abstract
There is no abstract available