Better bounds for minimizing SONET ADMs
From MaRDI portal
Publication:1004601
DOI10.1016/J.JCSS.2008.08.003zbMATH Open1181.68023OpenAlexW2023781385MaRDI QIDQ1004601FDOQ1004601
Publication date: 11 March 2009
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2008.08.003
Recommendations
Cites Work
Cited In (13)
- Approximation algorithms for grooming in optical network design
- SONET ADMs minimization with divisible paths
- Approximation and Online Algorithms
- Traffic partition in WDM/SONET rings to minimize SONET ADMs
- On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing
- On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology
- Structural Information and Communication Complexity
- Minimizing ADMs on WDM directed fiber trees
- Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths
- Approximation and Online Algorithms
- Minimization of SONET ADMs in ring networks revisited
- The chord version for SONET ADMs minimization
- On equilibria for ADM minimization games
This page was built for publication: Better bounds for minimizing SONET ADMs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004601)