Author:
Flammini Michele,Monaco Gianpiero,Moscardelli Luca,Shalom Mordechai,Zaks Shmuel
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference19 articles.
1. Amini, O., Pérennes, S., Sau, I.: Hardness and approximation of traffic grooming. Theor. Comput. Sci. 410(38–40), 3751–3760 (2009)
2. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation, Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)
3. Chen, S., Ljubić, I., Raghavan, S.: The regenerator location problem. Networks 55(3), 205–220 (2010)
4. Chvátal, V.: A greedy heuristic for the set covering problem. Math. Oper. Res. 4, 233–235 (1979)
5. Călinescu, G., Frieder, O., Wan, P.-J.: Minimizing electronic line terminals for automatic ring protection in general WDM optical networks. IEEE J. Sel. Areas Commun. 20(1), 183–189 (2002)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献