Approximation algorithms for grooming in optical network design

DOI10.1016/J.TCS.2011.03.034MaRDI QIDQ551206zbMATH OpenOpenAlexFDO

Authors Spyridon Antonakopoulos, Lisa Zhang

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

zbMATH Keywords

approximation algorithmscycle packingtraffic groomingoptical network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Recommendations

• Approximating the traffic grooming problem
• Algorithms and Computation
• Hardness and Approximation of Traffic Grooming
• Hardness and approximation of traffic grooming
• Traffic Grooming: Combinatorial Results and Practical Resolutions

Cites work

• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• Approximability of Packing Disjoint Cycles
• Approximation algorithms and hardness results for cycle packing problems
• Approximation algorithms for cycle packing problems
• Approximation algorithms for the design of SDH/SONET networks
• Better bounds for minimizing SONET ADMs
• Hardness and approximation of traffic grooming
• On the Cost of Interchange Rearrangement in Strings
• Optimization, approximation, and complexity classes
• Packing cycles in undirected graphs
• Pattern matching with address errors
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• The NP-Completeness of Some Edge-Partition Problems
• The SONET edge‐partition problem

Cited in

(12)

• Optimizing regenerator cost in traffic grooming
• AN EFFICIENT HEURISTIC FOR TRAFFIC GROOMING AND LIGHT-PATH ROUTING IN WDM RING NETWORKS WITH HOP-COUNT CONSTRAINT
• Approximating the traffic grooming problem
• Path decomposition under a new cost measure with applications to optical network design
• Maximum cycle packing in Eulerian graphs using local traces
• A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
• Lower bounds for two-period grooming via linear programming duality
• Algorithms – ESA 2004
• Designing hypergraph layouts to GMPLS routing strategies
• A cost-efficient scheduling algorithm for traffic grooming
• A traffic-grooming algorithm for wavelength-routed optical networks
• Hardness and Approximation of Traffic Grooming

This page was built for publication: Approximation algorithms for grooming in optical network design

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