Author:
Flammini Michele,Monaco Gianpiero,Moscardelli Luca,Shalom Mordechai,Zaks Shmuel
Publisher
Springer Berlin Heidelberg
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, Heidelberg (1999)
3. Chen, S., Ljubic, I., Raghavan, S.: The regenerator location problem, vol. 55, pp. 205–220 (2010)
4. Chvátal, V.: A greedy heuristic for the set covering problem. Mathematics of Operation Research 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 Journal of Selected Area on Communications 20(1), 183–189 (2002)