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]

@inproceedings{TalebiAKR15,
  title = {Spectrum assignment in rings with shortest-path routing: Complexity and approximation algorithms},
  author = {Sahar Talebi and Furqan Alam and Iyad Katib and George N. Rouskas},
  year = {2015},
  doi = {10.1109/ICCNC.2015.7069420},
  url = {http://dx.doi.org/10.1109/ICCNC.2015.7069420},
  researchr = {https://researchr.org/publication/TalebiAKR15},
  cites = {0},
  citedby = {0},
  pages = {642-647},
  booktitle = {International Conference on Computing, Networking and Communications, ICNC 2015, Garden Grove, CA, USA, February 16-19, 2015},
  publisher = {IEEE Computer Society},
  isbn = {978-1-4799-6959-3},
}