Approximation Algorithms for Broadcasting and Gossiping

Journal of Parallel and Distributed Computing

Volumn 43, Issue 1, 1997, Pages 47-55

  Fraigniaud, Pierre ^a   Vial, Sandrine ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012919778     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1997.1318     Document Type: Article

References (22)

1. Bermond J.-C., Fraigniaud P. Broadcasting and NP-completeness. Graph Theory Nodes New York. 22:1992;8-14.
2. J.-C. Bermond, L. Gargano, A. Rescigno, U. Vaccaro, Optimal gossiping by short messages, Dipartimento di Informatica ed Applicazioni, Salerno, Italy.
3. Cybenko G., Krumme D. W., Venkataraman K. N. Gossiping in minimum time. SIAM J. Comput. 21:1992;111-139.
4. Edmonds J. Edge-disjoint branchings, combinatorial algorithms. Combinatorial Algorithms 91-96. 1972;Algorithmics Press, New York.
5. Farley A., Proskurowski A. Gossiping in grid graphs. J. Combin. Inform. System Sci. 5:1980;161-172.
6. Feige U., Peleg D., Raghavan P., Upfal E. Randomized broadcast in networks. Lecture Notes in Computer Science. 1990;128-137.
7. Fraigniaud P., Laforest C. Disjoint spanning trees of small depth. Parallel Computing: Trends and Applications. 1994;Elsevier, Amsterdam. p. 105-112.
8. Fraigniaud P., Lazard E. Methods and problems of communication in usual networks. Discrete Appl. Math. 53:1994;79-133.
9. Fraigniaud P., Vial S. Approximation algorithms for information dissemination problems: Broadcasting and gossiping. Technical Report. 95-15:1995.
10. Hedetniemi S. M., Hedetniemi S. T., Liestman A. A survey of gossiping and broadcasting in communication networks. Networks. 18:1986;319-349.
11. Hromkovic J., Klasing R., Monien B., Peine R. Du Ding-Zhu, Hsu D. Frank. Dissemination of information in interconnection networks (broadcasting and gossiping). 1995;125-212 Kluwer Academic.
12. Hromkovic J., Klasing R., Pardubska D., Unger W., Waczulic J., Wagener H. Effective systolic algorithms for gossiping in cycles and two-dimensional grids. Lecture Notes in Computer Science. 965:1995;273-282.
13. Hromkovic J., Klasing R., Pardubska D., Unger W., Wagener H. The complexity of systolic dissemination of information in interconnection networks. Lecture Notes in Computer Science. 824:1994;219-230.
14. Knodel W. New gossips and telephones. Discrete Math. 13:1975;95.
15. Kortsarz G., Peleg D. Approximation algorithms for minimum time broadcast. Lecture Notes in Computer Science. 601:1992.
16. Liestman A., Richards D. Network communication in edge-colored graphs: Gossiping. IEEE Trans. Parallel Distrib. Systems. 4:1993;438-445.
17. Lovasz L. On two minimax theorems in graph theory. J. Combin. Theory B. 21:1976;96-103.
18. McCuaig W. A simple proof of Menger's theorem. J. Graph Theory. 8:1984;427-429.
19. Middendorf M. Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2. Inform. Process. Lett. 46:1993;281-287.
20. R. Ravi, 1994, Rapid rumor ramification: Approximating the minimum broadcast time, 35th Symposium on Foundations of Computer Science, 202, 213, IEEE Computer Soc. Los Alamitos, CA.
21. Scheuermann P., Wu G. Heuristic algorithms for broadcasting in point-to-point computer networks. IEEE Trans. Comput. C. 33:1984;804-811.
22. Slater P., Cockayne E., Hedetniemi S. Information dissemination in trees. SIAM J. Comput. 10:1981;692-701.