The following pages link to (Q4250199):
Displaying 16 items.
- Upgrading edge-disjoint paths in a ring (Q429680) (← links)
- Maximizing profits of routing in WDM networks (Q813327) (← links)
- The price of atomic selfish ring routing (Q975753) (← links)
- Routing to reduce the cost of wavelength conversion (Q1005233) (← links)
- The permutation-path coloring problem on trees. (Q1401295) (← links)
- Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs (Q1605303) (← links)
- Optimal bandwidth utilization of all-optical ring with a converter of degree 4. (Q1850660) (← links)
- Approximation algorithms for routing and call scheduling in all-optical chains and rings. (Q1853488) (← links)
- Approximation algorithms for the ring loading problem with penalty cost (Q2350601) (← links)
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems (Q2357824) (← links)
- Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem (Q2382677) (← links)
- Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem (Q2466024) (← links)
- Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960) (← links)
- Minimizing maximum fiber requirement in optical networks (Q2581759) (← links)
- Online mixed ring covering problem with two nodes (Q2677362) (← links)
- An integer programming approach to routing in daisy networks (Q5469130) (← links)
