Skip to main content
Springer Nature Link
Log in

Fixed topology steiner trees and spanning forests with applications in network communications

  • Session 11: Algorithms and Applications
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1276))

Included in the following conference series:

  • 109 Accesses

Abstract

We present pseudo-polynomial time algorithms for fixed topology Steiner tree problems with various time-delay constraints. We study the spanning forest problem with bandwidth constraint. A polynomial-time algorithm is given. Those problems have applications in network communications.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. H. Cormen, C.E. Leiserson, and R. L. Rivest, Introduction to algorithms. (MIT press, 1990)

    Google Scholar 

  2. M.R. Gary and D.S johnson, Computers and intractability: a guide to the theory of NP-completeness, (Freeman, New York, 1979)

    Google Scholar 

  3. F. K. Hwang, A linear time algorithm for full Steiner trees, Operations Research Letters, Vol 4, pp. 235–237, 1986.

    Google Scholar 

  4. F.K. Hwang and D.S. Richards, Steiner tree problems, Networks, vol. 22, 1992. pp. 55–89.

    Google Scholar 

  5. X. Jia, Modeling and simulations of multicast routing algorithms for advanced network applications, submitted for publication.

    Google Scholar 

  6. D. Sankoff and P. Rousseau, Locating the vertices of Steiner tree in an arbitrary metric space, Math. Program. Vol 9, pp. 240–246, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong

    Lusheng Wang & Xiaohua Jia

Authors
  1. Lusheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaohua Jia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tao Jiang D. T. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, L., Jia, X. (1997). Fixed topology steiner trees and spanning forests with applications in network communications. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045104

Download citation

  • DOI: https://doi.org/10.1007/BFb0045104

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63357-0

  • Online ISBN: 978-3-540-69522-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics