1. Karp, R.: Reducibility among combinatorial problems. In: Compexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
2. Awerbuch, B., Gawlick, R., Leighton, F., Rabani, Y.: On-line admission control and circuit routing for high performance computing and communication. In: 35th IEEE Symposium on Foundations of Computer Science, pp. 412–423 (1994)
3. Raghavan, P., Upfal, E.: Efficient all-optical routing. In: 26th Annual ACM Symposium on Theory of Computing, pp. 134–143 (1994)
4. Aggarwal, A., Bar-Noy, A., Coppersmith, D., Ramaswami, R., Schieber, B., Sudan, M.: Efficient routing and scheduling algorithms for optical networks. In: 5th ACM-SIAM Symposium on Discrete Algorithms, pp. 412–423 (1994)
5. Lecture Notes in Computer Science;J. Hromkovič,1993