1. Hakimi, S.L.: Steiner problem in graphs and its implications. Networks 1(2), 113–133 (1971)
2. Garey, M., Johnson, D.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco (1971)
3. Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast routing for multimedia communication. IEEE/ACM Transactions on Networking 1(3), 286–292 (1993)
4. Zhu, Q., Parsa, M., Garcia-Luna-Aceves, J.: A source based algorithm for delay-constrained minimum-cost multicasting. In: INFOCOM 1995: Fourteenth annual joint conference of the IEEE computer and communication societies, vol. 1, pp. 377–385 (1995)
5. Salama, H.F., Reeves, D.S., Viniotis, Y.: Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE Journal on Selected Areas in Communications 15(3), 332–345 (1997)