SONET ADMs minimization with divisible paths

DOI10.1007/S00453-007-0182-4MaRDI QIDQ2461634zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Asaf Levin

Publication date 28 November 2007

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-007-0182-4

Mathematics Subject Classification ID

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

Recommendations

• Approximation and Online Algorithms
• The chord version for SONET ADMs minimization
• Minimization of SONET ADMs in ring networks revisited
• Approximation and Online Algorithms
• Better bounds for minimizing SONET ADMs

Cited in

(6)

• Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
• Better bounds for minimizing SONET ADMs
• Approximation and Online Algorithms
• Approximation and Online Algorithms
• Minimization of SONET ADMs in ring networks revisited
• The chord version for SONET ADMs minimization

This page was built for publication: SONET ADMs minimization with divisible paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2461634)