Routing to Multiple Destinations in Computer Networks
Authors:
- K. Bharath-KumarKBK. Bharath-Kumar
- J. JaffeJJJ. Jaffe
- 1 March 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 31 (3) , 343-351
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Distributed Multi-Destination Routing: The Constraints of Local InformationSIAM Journal on Computing, 1985
- Routing and Flow Control in TYMNETIEEE Transactions on Communications, 1981
- A fast algorithm for Steiner treesActa Informatica, 1981
- The New Routing Algorithm for the ARPANETIEEE Transactions on Communications, 1980
- Reverse path forwarding of broadcast packetsCommunications of the ACM, 1978
- Enhanced message addressing capabilities for computer networksProceedings of the IEEE, 1978
- An Analysis of Several Heuristics for the Traveling Salesman ProblemSIAM Journal on Computing, 1977
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968