English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Approximating the Interval Constrained Coloring Problem

MPS-Authors
/persons/resource/persons44003

Althaus,  Ernst
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44218

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

/persons/resource/persons44374

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

/persons/resource/persons44737

Karrenbauer,  Andreas       
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dx74n
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Althaus, E., Canzar, S., Elbassioni, K., Karrenbauer, A., & Mestre, J. (2008). Approximating the Interval Constrained Coloring Problem. In J. Gudmundsson (Ed.), Algorithm Theory – SWAT 2008 (pp. 210-221). Berlin: Springer. doi:10.1007/978-3-540-69903-3_20.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1B03-D
Abstract
There is no abstract available