Reference35 articles.
1. P.K. Agarwal and M.T. Shing, Algorithms for special cases of rectilinear Steiner trees: I. points on the boundary of a rectilinear rectangle, Networks, Vol.20 (1990) pp. 453–485.
2. A.V. Aho, M.R. Garey, and F.K. Hwang, Rectilinear Steiner trees: Efficient special case algorithms, Networks, Vol.7 (1977) pp. 37–58.
3. M. Bern, Network design problems: Steiner trees and spanning k-trees, Ph.D. thesis, Computer Science Division, University of California at Berkeley, 1987.
4. M. Bern, Faster exact algorithms for Steiner trees in planar networks, Networks, Vol.20 (1990) pp. 109–120.
5. M. Bern and D. Bienstock, Polynomially solvable special cases of the Steiner problem in planar networks, Annals of Operations Research, Vol.33 (1991) pp. 405–418.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献