Publisher
Springer Science and Business Media LLC
Subject
Software,Theoretical Computer Science
Reference34 articles.
1. Cheng, X., Du, D.Z.: Steiner Trees in Industry. Springer, Berlin (2002)
2. Hakimi, S.L.: Steiner’s problem in graphs. Networks 1, 113–133 (1971)
3. Hwang, F.K.: On Steiner minimal trees with rectilinear distance. SIAM J. Appl. Math. 30(1), 104–114 (1976)
4. Smith, W.D.: How to find Steiner minimal trees in Euclidean d-space. Algorithmica 7(2/3), 137–177 (1992)
5. Johnson, D., Minkoff, M., Phillips, S.: The prize collecting Steiner tree problem: theory and practice. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 760–769 (2000)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献