Better bounds for minimizing SONET ADMs

DOI10.1016/J.JCSS.2008.08.003MaRDI QIDQ1004601zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Asaf Levin

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

zbMATH Keywords

approximation algorithmsoptical network designADM minimization

Mathematics Subject Classification ID

Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Recommendations

• Approximation and Online Algorithms
• Minimization of SONET ADMs in ring networks revisited
• Traffic partition in WDM/SONET rings to minimize SONET ADMs
• SONET ADMs minimization with divisible paths
• Approximation and Online Algorithms

Cites work

• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Approximation and Online Algorithms
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Traffic partition in WDM/SONET rings to minimize SONET ADMs

Cited in

(13)

• On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology
• Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths
• Minimization of SONET ADMs in ring networks revisited
• Approximation algorithms for grooming in optical network design
• On equilibria for ADM minimization games
• Traffic partition in WDM/SONET rings to minimize SONET ADMs
• Approximation and Online Algorithms
• SONET ADMs minimization with divisible paths
• The chord version for SONET ADMs minimization
• On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing
• Approximation and Online Algorithms
• Structural Information and Communication Complexity
• Minimizing ADMs on WDM directed fiber trees

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)