The hypocoloring problem: complexity and approximability results when the chromatic number is small
2004
Details
Title
The hypocoloring problem: complexity and approximability results when the chromatic number is small
Author(s)
de Werra, D. ; Demange, M. ; Monnot, J. ; Paschos, V. T.
Published in
Graph-Theoretic Concepts in Computer Science. WG 2004
Editor(s)
Pages
377-388
Conference
30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004
Date
2004
Publisher
Springer Verlag
Other identifier(s)
DAR: 6083
View record in Web of Science
View record in Web of Science
Laboratories
ROSE
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > ROSE - Chair of Operations Research SE
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Conference Papers
Work produced at EPFL
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Conference Papers
Work produced at EPFL
Published
Record creation date
2006-08-16