Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo. Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs. In Jozef Gruska, Branislav Rovan, Juraj Wiedermann, editors, Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings. Volume 233 of Lecture Notes in Computer Science, pages 501-511, Springer, 1986.

This author has not been identified. Look up 'Ludek Kucera' in GoogleThis author has not been identified. Look up 'Alberto Marchetti-Spaccamela' in GoogleThis author has not been identified. Look up 'Marco Protasi' in GoogleThis author has not been identified. Look up 'Maurizio Talamo' in Google

runs on WebDSL