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):
Displaying 11 items.
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- Optimizing regenerator cost in traffic grooming (Q655419) (← links)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- Real-time scheduling to minimize machine busy times (Q906551) (← links)
- LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← 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 Star Networks via Matching Techniques (Q3569115) (← links)
- Structural Information and Communication Complexity (Q5315217) (← links)
- Algorithms and Computation (Q5897923) (← links)