On the Complexity of the Traffic Grooming Problem in Optical Networks

Mordechai Shalom, Walter Unger, Shmuel Zaks. On the Complexity of the Traffic Grooming Problem in Optical Networks. In Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci, editors, Fun with Algorithms, 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings. Volume 4475 of Lecture Notes in Computer Science, pages 262-271, Springer, 2007. [doi]

Abstract

Abstract is missing.