1. Anshelevich, E., Zhang, L.: Path Decomposition under a New Cost Measure with Applications to Optical Network Design (full version),
http://www.cs.cornell.edu/people/eanshel/
2. Bazgan, C., Santha, M., Tuza, Z.: On the approximability of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs. Journal of Algorithms 31, 249–268
3. Bermond, J.-C., Marlin, N., Peleg, D., Pérennes, S.: Virtual path layouts with low congestion or low diameter in ATM networks. In: Proceedings of lère Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (1999)
4. Cosares, S., Saniee, I.: An optimization problem related to balancing loads on SONET rings. Telecommunications Systems 3, 165–181 (1994)
5. Doshi, B., Nagarajan, R., Blackwood, N., Jothipragasam, S., Raman, N., Sharma, M., Prasanna, S.: LIPI: A lightpath intelligent instantiation tool: capabilities and impact. Bell Labs Technical Journal (2002)