Sciweavers

141
Voted
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
15 years 10 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...