Preview
Unable to display preview. Download preview PDF.
References
Erdos, P., A. Renyi: "On random graphs 1", Publications Mathematicae (Debrecem), Vol. 6 (1959).
Even, S.: "Graph algorithms", Computer Science Press, Potomac (1979).
Foulds, L.R., V.J. Rayward-Smith: "Steiner problems in graphs: algorithms and applications", Engineering Optimization, 7 (1983).
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).
Kou, L., G. Markowsky, L. Berman: "A Fast Algorithm for Steiner Trees", Acta Informatica, 15 (1981).
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).
Author information
Authors and Affiliations
Editor information
Rights 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