Approximation algorithms for the design of SDH/SONET networks
RAIRO-Oper. Res., 37 4 (2003) 235-247
Published online: 2004-03-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Better approximating SONET k-edge partition for small capacity k
Junhui Ye, Huihuang Jiang, Guangting Chen, Yong Chen, Guohui Lin and An ZhangJournal of Combinatorial Optimization 49 (4) (2025)
https://doi.org/10.1007/s10878-025-01308-0
Approximation algorithms for grooming in optical network design
Spyridon Antonakopoulos and Lisa ZhangTheoretical Computer Science 412 (29) 3738 (2011)
https://doi.org/10.1016/j.tcs.2011.03.034
1548 (2009)
https://doi.org/10.1109/INFCOM.2009.5062072
Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths
Yong Wang and Qian‐Ping GuNetworks 53 (3) 276 (2009)
https://doi.org/10.1002/net.20264
On the complexity and algorithm of grooming regular traffic in WDM optical networks
Yong Wang and Qian-Ping GuJournal of Parallel and Distributed Computing 68 (6) 877 (2008)
https://doi.org/10.1016/j.jpdc.2008.01.001
Maximum throughput traffic grooming in optical networks
Yong Wang and Qian-Ping GuJournal of Optical Networking 7 (10) 895 (2008)
https://doi.org/10.1364/JON.7.000895
228 (2007)
https://doi.org/10.1109/ICCCN.2007.4317824
2337 (2007)
https://doi.org/10.1109/GLOCOM.2007.445
2407 (2006)
https://doi.org/10.1109/ICC.2006.255130
355 (2006)
https://doi.org/10.1109/ICPP.2006.38