The Rectilinear Steiner Tree Problem is NP Complete
暂无分享,去创建一个
[1] M. Hanan. A Counterexample to a Theorem of Fu on Steiner's Problem , 1972 .
[2] S. Louis Hakimi,et al. Steiner's problem in graphs and its implications , 1971, Networks.
[3] Richard M. Karp,et al. On the Computational Complexity of Combinatorial Problems , 1975, Networks.
[4] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[5] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[6] F. Hwang. On Steiner Minimal Trees with Rectilinear Distance , 1976 .
[7] S. E. Dreyfus,et al. The steiner problem in graphs , 1971, Networks.
[8] Shi-Kuo Chang,et al. The Generation of Minimal Trees with a Steiner Topology , 1972, JACM.
[9] Alfred V. Aho,et al. Rectilinear steiner trees: Efficient special-case algorithms , 1977, Networks.
[10] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.
[11] H. Pollak,et al. Steiner Minimal Trees , 1968 .