1. [1] S.E. Drefus and R.A. Wagner, “The Steiner problem in graphs,” Networks, vol.1, no.3, pp.195-207, 1971.
2. [2] A.J. Levin, “Algorithm for the shortest connection of a group of graph vertices,” Soviet Math. Dokladi, vol.12, pp.1477-1481, 1971.
3. [3] D. Molle, S. Richter, and P. Rossmanith, “A faster algorithm for the Steiner tree problem,” Proc. 23rd International Symposium on Theoretical Aspects of Computer Science, pp.561-570, Marseille, France, 2006.
4. [4] L.R. Foulds and P.B. Gibbons, “A branch and bound approach to the Steiner tree problem in graphs,” Proc. 14th Annual Conference of the Operational Research Society of New Zealand, New Zealand, pp.61-70, 1978.
5. [5] M.L. Shore, L.R. Foulds, and P.B. Gibbons, “An algorithm for the Steiner tree problem in graphs,” Networks, vol.12, no.3, pp.323-333, 1982.