A new exact algorithm for rectilinear Steiner trees
暂无分享,去创建一个
[1] J. L. Ganley. Geometric interconnection and placement algorithms , 1995 .
[2] Laurence A. Wolsey,et al. Trees and Cuts , 1983 .
[3] Denton E. Hewgill,et al. Exact Computation of Steiner Minimal Trees in the Plane , 1986, Inf. Process. Lett..
[4] A. Bonato,et al. Graphs and Hypergraphs , 2021, Clustering.
[5] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[6] Andrew B. Kahng,et al. A new class of iterative Steiner tree heuristics with good performance , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[7] J. Picard. Maximal Closure of a Graph and Applications to Combinatorial Problems , 1976 .
[8] F. Hwang. On Steiner Minimal Trees with Rectilinear Distance , 1976 .
[9] David S. Johnson,et al. The Complexity of Computing Steiner Minimal Trees , 1977 .
[10] M. Hanan,et al. On Steiner’s Problem with Rectilinear Distance , 1966 .
[11] Martin Grötschel,et al. Corrigendum to our paper “the ellipsoid method and its consequences in combinatorial optimization” , 1984, Comb..
[12] Martin Zachariasen,et al. Euclidean Steiner minimum trees: An improved exact algorithm , 1997, Networks.
[13] Pawel Winter,et al. An algorithm for the steiner problem in the euclidean plane , 1985, Networks.
[14] Jeffrey S. Salowe,et al. An exact rectilinear Steiner tree algorithm , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.
[15] J. Soukup,et al. Set of test problems for the minimum length connection networks , 1973, SMAP.
[16] J. Rhys. A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .
[17] David S. Johnson,et al. The Rectilinear Steiner Problem is NP-Complete , 1977 .
[18] J. Beasley. A heuristic for Euclidean and rectilinear Steiner problems , 1992 .
[19] Jeffrey S. Salowe,et al. Thirty-five-point rectilinear steiner minimal trees in a day , 1995, Networks.