Thirty-five-point rectilinear steiner minimal trees in a day
暂无分享,去创建一个
[1] F. Hwang. On Steiner Minimal Trees with Rectilinear Distance , 1976 .
[2] Robert E. Tarjan,et al. Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..
[3] Clark Thomborson,et al. A Probaby Fast, Provably Optimal Algorithm for Rectilinear Steiner Trees , 1994, Random Struct. Algorithms.
[4] H. T. Kung,et al. On the Average Number of Maxima in a Set of Vectors and Applications , 1978, JACM.
[5] Frank Thomson Leighton,et al. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[6] János Komlós,et al. Probabilistic partitioning algorithms for the rectilinear steiner problem , 1985, Networks.
[7] Pawel Winter,et al. Steiner problem in networks: A survey , 1987, Networks.
[8] 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..
[9] David S. Johnson,et al. The Rectilinear Steiner Problem is NP-Complete , 1977 .
[10] Pankaj K. Agarwal,et al. Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle , 1990, Networks.
[11] Robert E. Tarjan,et al. Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..
[12] Pawel Winter,et al. An algorithm for the steiner problem in the euclidean plane , 1985, Networks.
[13] Z. A. Melzak. On the Problem of Steiner , 1961, Canadian Mathematical Bulletin.
[14] David S. Johnson,et al. The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.
[15] David A. Plaisted,et al. A Heuristic Algorithm for Small Separators in Arbitrary Graphs , 1990, SIAM J. Comput..
[16] R. Graham,et al. On Steiner trees for bounded point sets , 1981 .
[17] Joseph L. Ganley,et al. Optimal Rectilinear Steiner Minimal Trees in O (n22.62n) Time , 1994, CCCG.
[18] Bowen Alpern,et al. Rectilinear Steiner Tree Minimization on a Workstation , 1992, Computational Support for Discrete Mathematics.
[19] Ralf Hartmut Güting,et al. Fast Algorithms for Direct Enclosures and Direct Dominances , 1989, J. Algorithms.
[20] Denton E. Hewgill,et al. Exact Computation of Steiner Minimal Trees in the Plane , 1986, Inf. Process. Lett..
[21] Joseph L. Ganley,et al. A faster dynamic programming algorithm for exact rectilinear Steiner minimal trees , 1994, Proceedings of 4th Great Lakes Symposium on VLSI.
[22] Dana S. Richards,et al. An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[23] M. Hanan,et al. On Steiner’s Problem with Rectilinear Distance , 1966 .