Research NoteApproximation Algorithms for Broadcasting and Gossiping
References (23)
- et al.
Methods and problems of communication in usual networks
Discrete Appl. Math.
(1994) New gossips and telephones
Discrete Math.
(1975)On two minimax theorems in graph theory
J. Combin. Theory B
(1976)Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
Inform. Process. Lett.
(1993)- et al.
Broadcasting and NP-completeness
Graph Theory Nodes New York
(1992) - J.-C. Bermond, L. Gargano, A. Rescigno, U. Vaccaro, Optimal gossiping by short messages, Dipartimento di Informatica ed...
- et al.
Gossiping in minimum time
SIAM J. Comput.
(1992) Edge-disjoint branchings, combinatorial algorithms
Combinatorial Algorithms 91–96
(1972)- et al.
Gossiping in grid graphs
J. Combin. Inform. System Sci.
(1980) - et al.
Randomized broadcast in networks
Lecture Notes in Computer Science
(1990)
Disjoint spanning trees of small depth
Parallel Computing: Trends and Applications
Cited by (34)
Rumor spreading with bounded in-degree
2020, Theoretical Computer ScienceCitation Excerpt :It is well known that computing an optimal schedule in the phone call model is NP-complete [14] and this even holds if the network graph is a planar three regular graph [25]. There are several papers that either prove approximations of optimal schedules, e.g., [26,11] or that try to solve the problem by a heuristic approach [21]. For a good summary on general information dissemination in communication networks we also refer to the book of Hromkovič et al. [19].
Broadcasting in weighted trees under the postal model
2016, Theoretical Computer ScienceOptimizing social media message dissemination problem for emergency communication
2014, Computers and Industrial EngineeringCitation Excerpt :Gossiping and broadcasting are two well-known problems in the communications and wireless networks domain. We provide Table 3 as a summary of the survey (Hedetniem, Hedetniem, & Liestman, 1988) and additional literature (Fraigniaud & Vial, 1997; Ravi, 1994) to illustrate the differences between such problems and SMMD. Furthermore, we use Table 3 to indicate how SMMD contributes to the current knowledge gap in communications and network optimization.
On the number of broadcast schemes in networks
2006, Information Processing LettersAn efficient heuristic for broadcasting in networks
2006, Journal of Parallel and Distributed ComputingEfficient trigger-broadcasting in heterogeneous clusters
2005, Journal of Parallel and Distributed Computing
R. Rustin, Ed.
- 1
Both authors are supported by the research programs PRS and ANM of the CNRS