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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Sahar Talebi' in GoogleThis author has not been identified. Look up 'Furqan Alam' in GoogleThis author has not been identified. Look up 'Iyad Katib' in GoogleThis author has not been identified. Look up 'George N. Rouskas' in Google

runs on WebDSL