Approximation Algorithms for the Interval Constrained Coloring Problem

Althaus, Ernst; Canzar, Stefan; Elbassioni, Khaled; Karrenbauer, Andreas; Mestre, Julian

doi:10.1007/s00453-010-9406-0

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Approximation Algorithms for 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;

/persons/resource/persons45030

Mestre, Julian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dx73o
(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. (2011). Approximation Algorithms for the Interval Constrained Coloring Problem. Algorithmica, 61(2), 342-361. doi:10.1007/s00453-010-9406-0.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0010-11EC-0

Abstract

There is no abstract available