scientific article; zbMATH DE number 1303573
From MaRDI portal
Publication:4250199
zbMath0942.68142MaRDI QIDQ4250199
Gordon Wilfong, Peter M. Winkler
Publication date: 21 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
Cutting-plane-based algorithms for two branch vertices related spanning tree problems ⋮ Coloring all directed paths in a symmetric tree, with an application to optical networks ⋮ Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem ⋮ Online mixed ring covering problem with two nodes ⋮ The permutation-path coloring problem on trees. ⋮ Upgrading edge-disjoint paths in a ring ⋮ Unnamed Item ⋮ 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 ⋮ The price of atomic selfish ring routing ⋮ The complexity of path coloring and call scheduling ⋮ Sparse and limited wavelength conversion in all-optical tree networks ⋮ Routing to reduce the cost of wavelength conversion ⋮ An integer programming approach to routing in daisy networks ⋮ 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. ⋮ Minimizing maximum fiber requirement in optical networks ⋮ Approximation algorithms for the ring loading problem with penalty cost ⋮ Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs ⋮ Maximizing profits of routing in WDM networks
This page was built for publication:
