Combinatorial approximation algorithms for spectrum assignment problem in chain and ring networks

DOI10.1007/978-3-319-71150-8_12MaRDI QIDQ1699773zbMATH OpenOpenAlexFDO

Authors Guang-Ting Chen, Lei Zhang, An Zhang, Yong Chen

Publication date 26 February 2018

Full work available at URL https://doi.org/10.1007/978-3-319-71150-8_12

zbMATH Keywords

approximation algorithmnetwork designspectrum assignmentworst-case performance ratio

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• Approximation algorithms for channel allocation problems in broadcast networks
• Approximation algorithms for channel allocation problems in broadcast networks
• scientific article; zbMATH DE number 17557
• A branch-and-cut algorithm for the routing and spectrum allocation problem
• The constrained-routing and spectrum assignment problem: valid inequalities and branch-and-cut algorithm
• Approximation algorithms for channel assignment with constraints
• scientific article; zbMATH DE number 1522941
• Approximation Algorithms for Minimum Span Channel Assignment Problems
• An approximation algorithm for channel assignment with certain constraints
• Integer programming models for the routing and spectrum allocation problem

Cited in

(1)

• On spectrum assignment in elastic optical tree-networks

This page was built for publication: Combinatorial approximation algorithms for spectrum assignment problem in chain and ring networks

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