Spectrum assignment in rings with shortest-path routing: Complexity and approximation algorithms

Sahar Talebi, Furqan Alam, Iyad Katib, George N. Rouskas. Spectrum assignment in rings with shortest-path routing: Complexity and approximation algorithms. In International Conference on Computing, Networking and Communications, ICNC 2015, Garden Grove, CA, USA, February 16-19, 2015. pages 642-647, IEEE Computer Society, 2015. [doi]

Abstract

Abstract is missing.