Speeding up the Dreyfus–Wagner algorithm for minimum Steiner trees
暂无分享,去创建一个
[1] Martin Zachariasen. The Rectilinear Steiner Tree Problem: A Tutorial , 2001 .
[2] S. E. Dreyfus,et al. The steiner problem in graphs , 1971, Networks.
[3] Joseph L. Ganley,et al. Optimal Rectilinear Steiner Minimal Trees in O (n22.62n) Time , 1994, CCCG.
[4] David M. Warme,et al. Exact Algorithms for Plane Steiner Tree Problems: A Computational Study , 2000 .
[5] F. Hwang. On Steiner Minimal Trees with Rectilinear Distance , 1976 .
[6] Michael Kaufmann,et al. On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results , 2000, Algorithmica.
[7] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[8] David S. Johnson,et al. The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.
[9] S. Hougardy,et al. Approximation Algorithms for the Steiner Tree Problem in Graphs , 2001 .
[10] D. Du,et al. Advances in Steiner trees , 2000 .