Fractional Path Coloring with Applications to WDM Networks

Authors:
Ioannis Caragiannis;Afonso Ferreira;Christos Kaklamanis;Stephane Perennes;Hervé Rivano
Affiliations:
-;-;-;-;-
Venue:
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Year:
2001

Citing 6
Cited 2

Optimal wavelength routing on directed fiber trees

Theoretical Computer Science
The complexity of path coloring and call scheduling

Theoretical Computer Science
Efficient Collective Communication in Optical Networks

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
The round-up property of the fractional chromatic number for proper circular arc graphs

Journal of Graph Theory

Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Approximation algorithms for path coloring in trees

Efficient Approximation and Online Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a symmetric directed graph with a minimum number of colors, in such a way that paths using the same arc of the graph have different colors. This classic combinatorial problem finds applications in the minimization of the number of wavelengths in wavelength division multiplexing (WDM) all-optical networks.