Weighted coloring: further complexity and approximability results

View/ Open
Date
2006Dewey
Recherche opérationnelleSujet
Partial k-tree; Line graph of bipartite graphs; Interval graphs; Weighted coloring; NP-Complete problems; Approximation algorithmsJournal issue
Information Processing LettersVolume
97Number
3Publication date
2006Article pages
98-103Publisher
ElsevierCollections
Metadata
Show full item recordAuthor
Paschos, Vangelis
Escoffier, Bruno
Monnot, Jérôme