Author:
Cinkler Tibor,Coudert David,Flammini Michele,Monaco Gianpiero,Moscardelli Luca,Muñoz Xavier,Sau Ignasi,Shalom Mordechai,Zaks Shmuel
Publisher
Springer Berlin Heidelberg
Reference120 articles.
1. Amini, O., Peleg, D., Perennes, S., Sau, I., Saurabh, S.: Degree-constrained subgraph problems: Hardness and approximation results. In: 6th Workshop on Approximation and Online Algorithms (WAOA), Lecture Notes in Computer Science, vol. 5426, pp. 29–42. Springer (2009)
2. Amini, O., Pérennes, S., Sau Valls, I.: Hardness and approximation of traffic grooming. In: The 18th International Symposium on Algorithms and Computation (ISAAC 2007). Sendai, Japan (2007)
3. Beauquier, B., Bermond, J. C., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graph problems arising from wavelength–routing in all–optical networks. In: Proc. Conference WOCS97, Geneva, April 1997 (1997)
4. Bermond, J. C., Braud, L., Coudert, D.: Traffic grooming on the path. Theoretical Computer Science 384(2-3), 139–151 (2007)
5. Bermond, J. C., Ceroi, S.: Minimizing SONET ADMs in unidirectional WDM ring with grooming ratio 3. Networks 41(2), 83–86 (2003)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献