"Spectrum assignment in rings with shortest-path routing: Complexity and ..."

Sahar Talebi et al. (2015)

> Home

Details and statistics

DOI: 10.1109/ICCNC.2015.7069420

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-30

- view
  authority control:
- export record
  dblp key:
  - conf/iccnc/TalebiAKR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccnc/TalebiAKR15
Sahar Talebi, Furqan Alam, Iyad A. Katib, George N. Rouskas:
Spectrum assignment in rings with shortest-path routing: Complexity and approximation algorithms. ICNC 2015: 642-647

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.