Approximation algorithms for grooming in optical network design
From MaRDI portal
Publication:551206
DOI10.1016/j.tcs.2011.03.034zbMath1216.68044MaRDI QIDQ551206
Lisa Zhang, Spyridon Antonakopoulos
Publication date: 14 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.03.034
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
68W25: Approximation algorithms
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Hardness and approximation of traffic grooming
- Better bounds for minimizing SONET ADMs
- Optimization, approximation, and complexity classes
- Pattern matching with address errors
- The NP-Completeness of Some Edge-Partition Problems
- Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- Packing cycles in undirected graphs
- The SONET edge‐partition problem
- Approximation algorithms and hardness results for cycle packing problems
- Approximability of Packing Disjoint Cycles
- Approximation algorithms for the design of SDH/SONET networks
- On the Cost of Interchange Rearrangement in Strings