1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings

Authors:
Zhengbing Bian;Qian-Ping Gu
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby BC, Canada V5A 1S6;School of Computing Science, Simon Fraser University, Burnaby BC, Canada V5A 1S6
Venue:
Information Processing Letters
Year:
2009

Citing 7
Cited 0

Efficient routing in all-optical networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the k-coloring of intervals

Discrete Applied Mathematics
Data structures for weighted matching and nearest common ancestors with linking

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Call Control in Rings

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Satisfying a maximum number of pre-routed requests in all-optical rings

Computer Networks: The International Journal of Computer and Telecommunications Networking - Small and home networks
Efficient access to optical bandwidth

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Wavelength management in WDM rings to maximize the number of connections

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.90

Visualization

Abstract

We give a 1.5-approximation algorithm for the weighted maximum routing and wavelength assignment problem on undirected ring networks. This improves the previous 1.58-approximation result.