Pages that link to "Item:Q1004601"
From MaRDI portal
The following pages link to Better bounds for minimizing SONET ADMs (Q1004601):
Displaying 11 items.
- Approximation algorithms for grooming in optical network design (Q551206) (← links)
- The chord version for SONET ADMs minimization (Q817808) (← links)
- On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing (Q878685) (← links)
- Traffic partition in WDM/SONET rings to minimize SONET ADMs (Q1810863) (← links)
- Minimizing ADMs on WDM directed fiber trees (Q1884302) (← links)
- Minimization of SONET ADMs in ring networks revisited (Q2380804) (← links)
- On equilibria for ADM minimization games (Q2429352) (← links)
- SONET ADMs minimization with divisible paths (Q2461634) (← links)
- On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology (Q3408178) (← links)
- Structural Information and Communication Complexity (Q5710090) (← links)
- Approximation and Online Algorithms (Q5713444) (← links)