1. Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Multicasting in heterogeneous networks. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing (STOC 1998), pp. 448–453 (1998)
2. Beier, R., Sibeyn, J.F.: A powerful heuristic for telephone gossiping. In: Proceedings of the 7th International Colloquium on Structural Information Communication Complexity (SIROCCO 2000), pp. 17–36 (2000)
3. Bhabak, P., Harutyunyan, H.A.: Approximation algorithm for the broadcast time in k-path graph (abstract only). In: 3rd International Symposium on Combinatorial Optimization (ISCO 2014), p. 83 (2014)
4. Elkin, M., Kortsarz, G.: Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem. In: Proceedings of the thirty-fourth Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 438–447 (2002)
5. Elkin, M., Kortsarz, G.: Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract). In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 76–85 (2003)