book part or chapter
Complexity and Approximation Results for the Min Weighted Node Coloring Problem
February 3, 2010
Combinatorial Optimization and Theoretical Computer Science: Interfaces and Perspectives: 30th Anniversary of the LAMSADE
This chapter contains sections titled: Introduction General results Weighted node coloring in triangle-free planar graphs Weighted node coloring in bipartite graphs Split graphs Cographs Interval graphs Bibliography
Type
book part or chapter
Scopus ID
2-s2.0-84885500970
Author(s)
Demange, Marc
ESSEC Business School
Escoffier, Bruno
Université Paris-Dauphine
Monnot, Jérǒme
Université Paris-Dauphine
Paschos, Vangelis Th
Université Paris-Dauphine
École Polytechnique Fédérale de Lausanne
Date Issued
2010-02-03
Publisher
Published in
Combinatorial Optimization and Theoretical Computer Science: Interfaces and Perspectives: 30th Anniversary of the LAMSADE
ISBN of the book
9781848210219
Start page
259
End page
289
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
Available on Infoscience
February 4, 2026
Use this identifier to reference this record