Wavelength Management in WDM Rings to Maximize the Number of Connections
From MaRDI portal
Publication:5900915
DOI10.1137/06067660XzbMath1210.68073MaRDI QIDQ5900915
Publication date: 1 June 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Communication networks in operations research (90B18) Combinatorics in computer science (68R05) Deterministic network models in operations research (90B10) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25)
Related Items (12)
An Improved Approximation Bound for Spanning Star Forest and Color Saving ⋮ Tight approximation bounds for combinatorial frugal coverage algorithms ⋮ Near-Optimal Asymmetric Binary Matrix Partitions ⋮ Integrality gaps for colorful matchings ⋮ Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship ⋮ Unnamed Item ⋮ A 6/5-approximation algorithm for the maximum 3-cover problem ⋮ Near-optimal asymmetric binary matrix partitions ⋮ Bi-criteria and approximation algorithms for restricted matchings ⋮ Tight Approximation Bounds for Greedy Frugal Coverage Algorithms ⋮ A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ Generalized budgeted submodular set function maximization
This page was built for publication: Wavelength Management in WDM Rings to Maximize the Number of Connections
