1. An approximation scheme for finding Steiner trees with obstacles;Provan;SIAM Journal on Computing,1988
2. J. Liu, Y. Zhao, E. Shragowitz, G. Karypis, A polynomial time approximation scheme for rectilinear Steiner minimum tree construction in the presence of obstacles, in: 9th IEEE International Conference on Electronics, Circuits and Systems, vol. 2, 2002, pp. 781–784
3. Approximation of octilinear Steiner trees constrained by hard and soft obstacles;Müller-Hannemann,2006
4. G. Borradaile, C. Mathieu, P.N. Klein, A polynomial-time approximation scheme for Steiner tree in planar graphs, in: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 1285–1294
5. Steiner tree in planar graphs: An O(nlogn) approximation scheme with singly exponential dependence on epsilon;Borradaile,2007