Better bounds for minimizing SONET ADMs

DOI10.1016/j.jcss.2008.08.003zbMath1181.68023OpenAlexW2023781385MaRDI QIDQ1004601

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

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

Related Items (4)

Minimization of SONET ADMs in ring networks revisited ⋮ On equilibria for ADM minimization games ⋮ Approximation algorithms for grooming in optical network design ⋮ On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology

Cites Work

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

This page was built for publication: Better bounds for minimizing SONET ADMs