1. Chen, S., Ljubic, I., Raghavan, S.: The regenerator location problem. Networks 55(3), 205–220 (2010)
2. Dor, D., Tarsi, M.: Graph decomposition is np-complete: A complete proof of holyer’s conjecture. SIAM Journal on Computing 26(4), 1166–1187 (1997)
3. Edmonds, J.: Paths, trees, and flowers. Canad. J. Math. 17, 449–467 (1965)
4. Fedrizzi, R., Galimberti, G.M., Gerstel, O., Martinelli, G., Salvadori, E., Saradhi, C.V., Tanzi, A., Zanardi, A.: A Framework for Regenerator Site Selection Based on Multiple Paths. In: Prooceedings of IEEE/OSA Conference on Optical Fiber Communications (OFC) (to appear, 2010)
5. Fedrizzi, R., Galimberti, G.M., Gerstel, O., Martinelli, G., Salvadori, E., Saradhi, C.V., Tanzi, A., Zanardi, A.: Traffic Independent Heuristics for Regenerator Site Selection for Providing Any-to-Any Optical Connectivity. In: Proceedings of IEEE/OSA Conference on Optical Fiber Communications (OFC) (to appear, 2010)