The hypocoloring problem: complexity and approximability results when the chromatic number is small

View/ Open
Date
2004Collection title
Lecture Notes in Computer ScienceCollection Id
3353Dewey
Recherche opérationnelleSujet
Algorithms; Approximability; Complexity; Weighted graphs; Subcoloring problemConference name
30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'04)Conference date
06-2004Conference city
Bad HonnefConference country
AllemagneBook title
Graph-Theoretic Concepts in Computer Science 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised PapersAuthor
Hromkovic, Juraj; Nagl, Manfred; Westfechtel, BernhardPublisher
SpringerPublisher city
BerlinYear
2004Pages number
404ISBN
978-3-540-24132-4Book URL
http://dx.doi.org/10.1007/b104584Collections
Metadata
Show full item recordAuthor
de Werra, Dominique
Demange, Marc
Monnot, Jérôme
Paschos, Vangelis