The following pages link to Algorithms and Computation (Q5897923):
Displaying 14 items.
- Approximating the traffic grooming problem in tree and star networks (Q436821) (← links)
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- Approximation algorithms for grooming in optical network design (Q551206) (← links)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- Approximating the traffic grooming problem (Q1018099) (← links)
- LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← links)
- On ring grooming in optical networks (Q2385478) (← links)
- A traffic-grooming algorithm for wavelength-routed optical networks (Q2892368) (← links)
- Traffic Grooming: Combinatorial Results and Practical Resolutions (Q3404459) (← links)
- Approximating the Traffic Grooming Problem in Tree and Star Networks (Q3522952) (← links)
- Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph (Q5302064) (← links)
- Structural Information and Communication Complexity (Q5315217) (← links)
- Hardness and Approximation of Traffic Grooming (Q5387787) (← links)