book part or chapter
Weighted Edge Coloring
February 3, 2010
Combinatorial Optimization and Theoretical Computer Science: Interfaces and Perspectives: 30th Anniversary of the LAMSADE
This chapter contains sections titled: Introduction Related problems Preliminaries and notation Complexity and (in) approximability Graphs of Δ = 2 A 2-approximation algorithm for general graphs Bipartite graphs Conclusions Bibliography
Type
book part or chapter
Scopus ID
2-s2.0-84885547937
Author(s)
Demange, Marc
ESSEC Business School
Escoffier, Bruno
Université Paris-Dauphine
Lucarelli, Giorgio
Department of Informatics, Athens University of Economics and Business
Milis, Ioannis
Department of Informatics, Athens University of Economics and Business
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
DOI of the book
ISBN of the book
9781848210219
9780470611098
Start page
291
End page
317
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
Available on Infoscience
February 5, 2026
Use this identifier to reference this record