Juraj Hromkovic, Ralf Klasing, Walter Unger, and Hubert Wagener. Optimal algorithms for broadcast and gossip in the edge-disjoint path modes. 411-439, June, 1995. Linear time algorithms on circular-arc graphs. Jan97 Klaus Jansen.
Approximation results for wavelength routing in directed trees.
Efficient bandwitdth allocation in directed optical fibre trees. KP96 Christos Kaklamanis and Pino Persiano. Efficient wavelength routing on directed fiber trees. Christos Kaklamanis, Pino Persiano, Thomas Erlebach, and Klaus Jansen. Constrained bipartite edge coloring with applications to wavelength routing.