Skip to main content
Log in

A Note on Optical Network with Nonsplitting Nodes

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

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.

    Google Scholar 

  • 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.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hongwei Du.

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-005-2273-y

Keywords

Navigation