1. Hakimi, S. L. (1971). Steiner problem in graphs and its implications. Networks, 1, 113–133.
2. Hwang, F. K., Richards, D. S., & Winter, P. (1992). The Steiner tree problem. Amsterdam: Elsevier Science/North-Holland.
3. Sun, Q., & Langendörfer, H. (1998). An efficient delay-constrained multicast routing algorithm. Journal of High-Speed Networks, 7(1), 43–55.
4. Guo, L., & Matta, I. (1999). QDMR: an efficient QoS dependent multicast routing algorithm. In RTAS’99: proceedings of the fifth IEEE real-time technology and applications symposium (pp. 213–222). Vancouver, BC, Canada. Washington: IEEE Comput. Soc.
5. Rouskas, G. N., & Baldine, I. (1997). Multicast routing with end-to-end delay and delay variation constraints. IEEE Journal on Selected Areas in Communications, 15(3), 346–356.