The following pages link to Algorithms and Computation (Q5897923):
Displaying 5 items.
- Approximating the traffic grooming problem in tree and star networks (Q436821) (← links)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← links)
- Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph (Q5302064) (← links)
- Hardness and Approximation of Traffic Grooming (Q5387787) (← links)