论文信息 - Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs - 字舞流文

Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs

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

[1] Kurt Mehlhorn,et al. A Faster Approximation Algorithm for the Steiner Problem in Graphs , 1988, Inf. Process. Lett..

[2] Victor J. Rayward-Smith,et al. Steiner problems in graphs: algorithms and applications , 1983 .

[3] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .

[4] Shimon Even,et al. Graph Algorithms , 1979 .