11. Weighted Edge Coloring

  1. Vangelis Th. Paschos
  1. Marc Demange,
  2. Bruno Escoffier,
  3. Giorgio Lucarelli,
  4. Ioannis Milis,
  5. Jérǒme Monnot,
  6. Vangelis Th. Paschos and
  7. Dominique de Werra

Published Online: 3 FEB 2010

DOI: 10.1002/9780470611098.ch11

Combinatorial Optimization and Theoretical Computer Science

Combinatorial Optimization and Theoretical Computer Science

How to Cite

Demange, M., Escoffier, B., Lucarelli, G., Milis, I., Monnot, J., Paschos, V. Th. and de Werra, D. (2008) Weighted Edge Coloring, in Combinatorial Optimization and Theoretical Computer Science (ed V. Th. Paschos), ISTE, London, UK. doi: 10.1002/9780470611098.ch11

Publication History

  1. Published Online: 3 FEB 2010
  2. Published Print: 1 JAN 2008

ISBN Information

Print ISBN: 9781848210219

Online ISBN: 9780470611098

SEARCH

Keywords:

  • communication systems;
  • switching network;
  • direct connections;
  • transmission time;
  • graph-theoretic terms

Summary

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