Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks
Lists
Only you see this
Abstract
Motivated by the wavelength assignment problem in WDM optical networks, we study path coloring problems in graphs. Given a set of paths P on a graph G, the path coloring problem is to color the paths of P so that no two paths traversing the same edge of G are assigned the same color and the total number of colors used is minimized. The problem has been proved to be NP-hard even for trees and rings.
BibTeX
@inproceedings{caragiannis2004approximate,
author = {Ioannis Caragiannis and Christos Kaklamanis},
title = {{Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks}},
booktitle = {STACS},
year = {2004},
doi = {10.1007/978-3-540-24749-4\_23},
}Loading related content...