Abstract
We study the problem of computing the minimum total weight multicast route in an optical network with both nonsplitting and splitting nodes, and present a simple approximation with performance ratio 3, which is better than existing one in the literature.
Similar content being viewed by others
References
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York, 1979.
N. Christofides, “Worst-case analysis of a new heuristic for the travelling salesman problem,” Technical Report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976.
G. Robins and A. Zelikovsky, “Improved Steiner tree approximation in graphs,” in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 2000, pp. 770–779.
S. Yan, J.S. Deogun, and M. Ali, “Routing in sparse splitting optical networks with multicast traffic,” Comput. Networks, vol. 41, no. 1, pp. 89–113, 2003.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Du, H., Jia, X., Wang, F. et al. A Note on Optical Network with Nonsplitting Nodes. J Comb Optim 10, 199–202 (2005). https://doi.org/10.1007/s10878-005-2273-y
Issue Date:
DOI: https://doi.org/10.1007/s10878-005-2273-y