Fractional Coloring of Bounded Degree Trees
Résumé
We study the dipath-coloring problem in bounded degree and treewidth symmetric digraphs, in which one needs to color the dipaths with a minimum number of colors, in such a way that dipaths using the same arc have different colors. This classic combinatorial problem finds applications in the minimizat- ion of the number of wavelengths in wavelength division multiplexing (WDM) all optical networks. In this paper, we prove that finding an optimal fractional coloring of such dipaths is polynomial. Our solution is constructiv- e, i.e. we give an effective polynomial algorithm for the problem above. We also show some relationships between the integral and fractional problems, prove some polynomial instances of the coloring problem, and derive a $1 + 5/3e$ approximation for the \wdm problem in symmetric directed trees, where $e$ is the classical Neper constant, improving on previous results. Finally we present computational results suggesting that fractional coloring is a good oracle for a branch and bound strategy for coloring dipaths in symmetric directed trees and cycles.