Pages that link to "Item:Q436821"
From MaRDI portal
The following pages link to Approximating the traffic grooming problem in tree and star networks (Q436821):
Displayed 4 items.
- Optimizing regenerator cost in traffic grooming (Q655419) (← links)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- Real-time scheduling to minimize machine busy times (Q906551) (← links)
- LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← links)