Publication:4250199
From MaRDI portal
zbMath0942.68142MaRDI QIDQ4250199
Peter M. Winkler, Gordon Wilfong
Publication date: 21 August 2000
68W05: Nonnumerical algorithms
Related Items
Unnamed Item, Coloring all directed paths in a symmetric tree, with an application to optical networks, An integer programming approach to routing in daisy networks, The complexity of path coloring and call scheduling, Sparse and limited wavelength conversion in all-optical tree networks, Maximizing profits of routing in WDM networks, The price of atomic selfish ring routing, Routing to reduce the cost of wavelength conversion, The permutation-path coloring problem on trees., Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs, Optimal bandwidth utilization of all-optical ring with a converter of degree 4., Approximation algorithms for routing and call scheduling in all-optical chains and rings., Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem, Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem, Path problems in generalized stars, complete graphs, and brick wall graphs, Minimizing maximum fiber requirement in optical networks
