Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference64 articles.
1. M. Ajtai, V. Chvatal, M.M. Newborn and E. Szemeredi, Crossing free subgraphs, Ann. Discr. Math. 12(1982)1–12.
2. J. Beardwood, J.H. Halton and J.M. Hammersley, The shortest path through many points, Proc. Cambridge Phil. Soc. 55(1959)299–327.
3. M.W. Bern and R.L. Graham, The shortest-network problem, Sci. Amer. (Jan. 1989)84–89.
4. J.E. Beasley, A heuristic for the Euclidean and rectilinear Steiner tree problem, Working Paper, Managament School, Imperial College (1989).
5. R.S. Booth, Analytic formulas for full Steiner trees, Discr. Comput. Geom., to appear.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献