A faster approximation algorithm for the Steiner problem in graphs
暂无分享,去创建一个
[1] Yash P. Aneja,et al. An integer linear programming approach to the steiner problem in graphs , 1980, Networks.
[2] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[3] Henry O. Pollak,et al. Some Remarks on the Steiner Problem , 1978, J. Comb. Theory A.
[4] George Markowsky,et al. A fast algorithm for Steiner trees , 1981, Acta Informatica.
[5] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[6] Ding-Zhu Du,et al. A Short Proof of a Result of Pollak on Steiner Minimal Trees , 1982, J. Comb. Theory, Ser. A.
[7] K. Chao,et al. Steiner Minimal Trees , 2005 .
[8] John E. Beasley. An algorithm for the steiner problem in graphs , 1984, Networks.
[9] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[10] Ronald L. Graham,et al. Some NP-complete geometric problems , 1976, STOC '76.