1. [1] J. Huang and Y. Liu, “MOEAQ: A QoS-aware multicast routing algorithm for MANET,” Expert Systems with Application, vol.37, no.2, pp.1391-1399, March 2010.
2. [2] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
3. [3] H. Takahashi and A. Matsuyama, “An approximate solution for the Steiner problem in graphs,” Math. Japonica, vol.24, no.6, pp.573-577, Nov. 1980.
4. [4] A. Zelikovsky, “An 11/6-approximation algorithm for the network steiner problem,” Algorithmica, vol.9, no.5, pp.463-470, May 1993.
5. [5] G. Robins and A. Zelikovsky, “Improved Steiner tree approximation in graphs,” Proc. 11th Annu. ACM-SIAM SODA, pp.770-779, San Francisco, California, Jan. 2000.