Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs.

Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo

Browse the full MFCS paper archive.