Author:
De Marco Gianluca,Gargano Luisa,Vaccaro Ugo
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. E. Ahaxoni, R. Cohen, “Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks”, Proc. INFOCOM'97, Kobe, Japan, April 1997.
2. B. Awerbuch, A. Barowtz, D. Peleg, “Cost-Sensitive Analysis of Communication Protocols”, Proceedings of PODC'90, 177–187.
3. A. Bagchi, E.F. Schmeichel, and S.L. Hakimi, “Parallel Information Dissemination by Packets”, SIAM J. on Computing, 23 (1994), 355–372.
4. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber, “Multicasting in Heterogeneous Networks”, Proceedings of STOC '98.
5. F. Bauer, A. Varma, “Aries: a Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm, Proc. INFOCOM'96, 361–368.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献