Multicast tree generation in networks with asymmetric links
Author:
- S. RamanathanSRS. Ramanathan
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 4 (4) , 558-568
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Multicast routing for multimedia communicationIEEE/ACM Transactions on Networking, 1993
- On the hardness of approximating minimization problems1993
- Routing broadband multicast streamsComputer Communications, 1992
- Steiner tree problemsNetworks, 1992
- On multicast path finding algorithms1991
- Routing of multipoint connectionsIEEE Journal on Selected Areas in Communications, 1988
- Routing to Multiple Destinations in Computer NetworksIEEE Transactions on Communications, 1983
- The computation of nearly minimal Steiner trees in graphsInternational Journal of Mathematical Education in Science and Technology, 1983
- A fast algorithm for Steiner treesActa Informatica, 1981
- Reducibility among Combinatorial Problems1972