Skip to main content
SpringerLink
Log in

An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes

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

Abstract

Consider the problem of computing the minimum-weight multicast route in an optical network with both nonsplitting and splitting nodes. This problem can be reduced to the minimum Hamiltonian path problem when all nodes are nonsplitting, and the Steiner minimum tree problem when all nodes are splitting. Therefore, the problem is NP-hard. Previously, the best known polynomial-time approximation has the performance ratio 3. In this paper, we present a new polynomial-time approximation with performance ratio of 1+ρ, where ρ is the best known approximation performance ratio for the Steiner minimum tree in graph and it has been known that ρ < 1.55.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • N. Christofides, “Worst-case analysis of a new heuristic for the traveling salesman problem,” Technical Report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976.

  • H. Du, X. Jia, F. Wang, M. Thai, and Y. Li, “A note on optical network with nonsplitting nodes,” Journal of Combinatorial Optimization, vol. 10, pp. 199–202, 2005.

    Article  Google Scholar 

  • 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 

  • M. Karpinski and A. Zelikovsky, “New approximation algorithms for the Steiner tree problems,” Journal of Combinatorial Optimization, vol. 1, pp. 47–65, 1997.

    Article  MathSciNet  Google Scholar 

  • Gabriel Robins and Alexander Zelikovsky, “Improved Steiner tree approximation in graphs,” in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, pp. 770–779, 2000.

  • S. Yan, J.S. Deogun, and M. Ali, “Routing in sparse splitting optical networks with multicast traffic,” Computer Networks, vol. 41, no. 1, pp. 89–113, 2003.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science and Technology, Harbin, HeiLongJiang, China, 150001

    Longjiang Guo

  2. Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75083, USA

    Weili Wu

  3. Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, 55455, USA

    Feng Wang & My Thai

Authors
  1. Longjiang Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weili Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Feng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. My Thai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Weili Wu.

Additional information

Support in part by National Science Foundation under grants CCF-0514796 and CNS-0524429

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guo, L., Wu, W., Wang, F. et al. An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes. J Comb Optim 10, 391–394 (2005). https://doi.org/10.1007/s10878-005-4925-3

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-005-4925-3

Keywords

Search

Navigation