Anders Dessmark, Andrzej Lingas, Hans Olsson, and Hiroaki Yamamoto. Optimal broadcasting in almost trees and partial k -trees. Kay U. Drangmeister, Sven O. Krumke, Madhav V. Marathe, Hartmut Noltemeier, and S. S. Ravi. Modifying edges of a network to obtain short subgraphs. Pierre Fraigniaud and Sandrine Vial.
Approximation algorithms for broadcasting and gossiping.
Luisa Gargano and Adele A. Rescigno. Communication complexity of fault-tolerant information diffusion. Luisa Gargano, Adele A. Rescigno, and Ugo Vaccaro. Communication complexity of gossiping by packets. Bicriteria network design problems.