Optimal wavelength routing on directed fiber trees
From MaRDI portal
Publication:1960521
DOI10.1016/S0304-3975(99)00029-8zbMath0933.68155MaRDI QIDQ1960521
Pino Persiano, Christos Kaklamanis, Milena Mihail, Klaus Jansen, Erlebach, Thomas
Publication date: 12 January 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Parameterized Maximum Path Coloring, Minimizing ADMs on WDM directed fiber trees, Approximating call-scheduling makespan in all-optical networks, Parameterized maximum path coloring, The permutation-path coloring problem on trees., Path multicoloring with fewer colors in spiders and caterpillars, Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree, Path problems in generalized stars, complete graphs, and brick wall graphs, Conversion of coloring algorithms into maximum weight independent set algorithms, Sparse and limited wavelength conversion in all-optical tree networks, Fractional path coloring in bounded degree trees with applications, Selfish Routing and Path Coloring in All-Optical Networks, Colouring graphs with no induced six-vertex path or diamond, Approximation algorithms for routing and call scheduling in all-optical chains and rings., Minimizing maximum fiber requirement in optical networks, Routing and path multicoloring
Cites Work