Skip to main content
SpringerLink
Log in

Near optimal algorithms for finding minimum Steiner trees on random graphs

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1986 (MFCS 1986)

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

  • 157 Accesses

Work partially supported by IASI-CNR, and Project MPI "Teoria e Progetto di Algoritmi".

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. Erdos, P., A. Renyi: "On random graphs 1", Publications Mathematicae (Debrecem), Vol. 6 (1959).

    Google Scholar 

  2. Even, S.: "Graph algorithms", Computer Science Press, Potomac (1979).

    Google Scholar 

  3. Foulds, L.R., V.J. Rayward-Smith: "Steiner problems in graphs: algorithms and applications", Engineering Optimization, 7 (1983).

    Google Scholar 

  4. Karp, R.M.: "Reducibility among Combinatorial Problems", in Complexity of Computer Computations, ed. R.E. Miller and J.W. Thatcher, New York, Plenum Press (1972).

    Google Scholar 

  5. Kou, L., G. Markowsky, L. Berman: "A Fast Algorithm for Steiner Trees", Acta Informatica, 15 (1981).

    Google Scholar 

  6. Wu, Y.F., P. Widmayer, C.K. Wong: "A Faster Approximation Algorithm for the Steiner problem in graphs", IBM Thomas Watson Research Center Report (1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Charles University, Praha

    L. Kucera

  2. Università di Roma, Roma

    A. Marchetti-Spaccamela

  3. Università dell'Aquila, L'Aquila

    M. Protasi

  4. IASI-CNR, Roma

    M. Talamo

Authors
  1. L. Kucera
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Marchetti-Spaccamela
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Protasi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Talamo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kucera, L., Marchetti-Spaccamela, A., Protasi, M., Talamo, M. (1986). Near optimal algorithms for finding minimum Steiner trees on random graphs. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016276

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16783-9

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation