Approximation Algorithms for the Interval Constrained Coloring Problem
Article
Althaus, Ernst, Canzar, Stefan, Elbassioni, Khaled, Karrenbauer, Andreas and Mestre, Julián (2011) Approximation Algorithms for the Interval Constrained Coloring Problem. Algorithmica 61 (2), pp. 342-361.Alternative links to fulltext
Involved Institutions
Details
| Item type | Article | ||||
| Journal or Publication Title | Algorithmica | ||||
| Publisher | Springer Nature | ||||
| Volume | 61 | ||||
| Number of Issue or Book Chapter | 2 | ||||
| Page Range | pp. 342-361 | ||||
| Date | 2011 | ||||
| Date of publication | 08 Jul 2026 05:40 | ||||
| Institutions | Informatics and Data Science > Department Computational Life Science > Algorithmische Bioinformatik (Prof. Dr. Stefan Canzar) | ||||
| Identification Number |
| ||||
| Keywords | Approximation algorithms, Coloring problems, LP rounding | ||||
| Dewey Decimal Classification | 000 Computer science, information & general works > 004 Computer science 500 Science > 570 Life sciences | ||||
| Status | Published | ||||
| Refereed | Yes, this version has been refereed | ||||
| Created at the University of Regensburg | No | ||||
| Item ID | 79645 |
Export bibliographical data
Owner only: item control page
Altmetric
Altmetric