\begin{thebibliography}{10}

\bibitem{HUITEMA}
C.~Huitema, {\em Routing in the {I}nternet}, Prentice Hall PTR, Englewood
  {C}liffs, New Jersey 07632, 1995.

\bibitem{HWANG}
F.~Hwang, D.~Richards, and P.~Winter, {\em The Steiner Tree Problem},
  volume~{\bf 53} of {\em Ann. Discrete Math.}, North-Holland, Amsterdam, 1992.

\bibitem{AGUILAR}
L.~Aguilar, ``Datagram routing for internet multicasting,'' in {\em Proc. ACM
  SIGCOMM '84 Communications Architectures and Protocols}, pp.  58--63. ACM,
  June 1984.

\bibitem{BHARATH}
K.~Bharath-Kumar and J.~M. Jaffe, ``Routing to multiple destinations in
  computer networks,'' {\em IEEE Trans. Comm.}, vol. {\bf COM-31}, no. 3, pp.
  343--351, March 1983.

\bibitem{STASSINOPOULOS}
G.~I. Stassinopoulos, ``Optimal dynamic routing in multidestination networks,''
  {\em IEEE Trans. Comm.}, vol. {\bf COM-35}, no. 4, pp. 472--475, April 1987.

\bibitem{STASSINOPOULOSa}
G.~I. Stassinopoulos and M.~G. Kazantzakis, ``A computationally efficient
  iterative solution of the multidestination optimal dynamic routing problem,''
  {\em IEEE Trans. Comm.}, vol. {\bf 39}, no. 9, pp. 1370--1378, 1991.

\bibitem{DEERING}
S.~E. Deering, {\em Multicast routing in a datagram internetwork}, PhD thesis,
  Dept. of Electrical Engineering, Stanford University, December 1991.

\bibitem{BELKEIR}
N.~E. Belkeir and M.~Ahamad, ``Low cost algorithms for message delivery in
  dynamic multicast groups,'' in {\em Proc. 9th Intl. Conf. Distributed
  Computing Systems}, pp.  110--117. IEEE, June 1989.

\bibitem{BERTSEKAS}
D.~Bertsekas and R.~Gallager, {\em Data networks}, Prentice-Hall, Inc., 2nd
  edition, 1992.

\bibitem{SEDGEWICK}
R.~Sedgewick, {\em Algorithms}, Addison-Wesley Publishing Company, Inc, New
  York, 2nd edition, 1989.

\end{thebibliography}
