Pages that link to "Item:Q4595505"
From MaRDI portal
The following pages link to On-line competitive algorithms for call admission in optical networks (Q4595505):
Displaying 7 items.
- The online knapsack problem with incremental capacity (Q283993) (← links)
- A preemptive algorithm for maximizing disjoint paths on trees (Q970615) (← links)
- Approximation algorithms for routing and call scheduling in all-optical chains and rings. (Q1853488) (← links)
- On-line routing in all-optical networks (Q1960517) (← links)
- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees (Q3512469) (← links)
- Colouring paths in directed symmetric trees with applications to WDM routing (Q4571981) (← links)
- On-line routing in all-optical networks (Q4571982) (← links)
