M. Fares, A. Loukissas, and A. Vahdat, A scalable, commodity data center network architecture, Proc. ACM SIGCOMM, pp.63-74, 2008.

A. Bar-noy, S. Guha, J. Naor, and B. Schieber, Multicasting in heterogeneous networks, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.347-358, 2000.
DOI : 10.1145/276698.276857

P. Crescenzi, C. Fiorini, and R. Silvestri, A note on the approximation of the max clique problem, Information Processing Letters, vol.40, issue.1, pp.1-5, 1991.
DOI : 10.1016/S0020-0190(05)80002-X

M. J. Dinneen, The Complexity of Broadcasting in Bounded-Degree Networks . ArXiv Mathematics e-prints, arXiv:math/9411222v1, 1994.

M. Elkin and G. Kortsarz, A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem, SIAM Journal on Computing, vol.35, issue.3, pp.672-689, 2005.
DOI : 10.1137/S0097539704440740

M. Elkin and G. Kortsarz, Sublogarithmic approximation for telephone multicast, Journal of Computer and System Sciences, vol.72, issue.4, pp.648-659, 2006.
DOI : 10.1016/j.jcss.2005.12.002

M. Elkin and G. Kortsarz, An Approximation Algorithm for the Directed Telephone Multicast Problem, Algorithmica, vol.45, issue.4, pp.569-583, 2006.
DOI : 10.1007/s00453-005-1196-4

P. Fraigniaud, Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode, Proc. 9th European Symp. on Algorithms (ESA), pp.440-451, 2001.
DOI : 10.1007/3-540-44676-1_37

P. Fraigniaud and E. Lazard, Methods and problems of communication in usual networks, Discrete Applied Mathematics, vol.53, issue.1-3, pp.79-133, 1994.
DOI : 10.1016/0166-218X(94)90180-5

M. Garey and D. Johnson, Computers and intractability: A guide to the theory of NP-completeness, 1979.

B. Haeupler, Simple, Fast and Deterministic Gossip and Rumor Spreading, Proc. 24th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp.705-716, 2013.

H. Harutyunyan, A. Liestman, J. Peters, and D. Richards, Broadcasting and Gossiping. Handbook of Graph Theory, pp.1477-1494, 2013.

H. Harutyunyan and W. Wang, Broadcasting Algorithm Via Shortest Paths, 2010 IEEE 16th International Conference on Parallel and Distributed Systems, pp.299-305, 2010.
DOI : 10.1109/ICPADS.2010.110

S. Hedetniemi, S. Hedetniemi, and A. Liestman, A survey of gossiping and broadcasting in communication networks, Networks, vol.3, issue.4, pp.319-349, 1988.
DOI : 10.1002/net.3230180406

J. Hromkovi´chromkovi´c, R. Klasing, B. Monien, and R. Peine, Dissemination of information in interconnection networks, Combinatorial Network Theory, Kluwer Academic, pp.125-212, 1995.

G. Kortsarz and D. Peleg, Approximation Algorithms for Minimum-Time Broadcast, SIAM Journal on Discrete Mathematics, vol.8, issue.3, pp.401-427, 1995.
DOI : 10.1137/S0895480193245923

T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays , Trees, Hypercubes, 1991.

C. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, Journal of Computer and System Sciences, vol.43, issue.3, pp.425-440, 1991.
DOI : 10.1016/0022-0000(91)90023-X

R. Ravi, Rapid rumor ramification: approximating the minimum broadcast time, Proceedings 35th Annual Symposium on Foundations of Computer Science, pp.202-213, 1994.
DOI : 10.1109/SFCS.1994.365693

P. Slater, E. Cockayne, and S. Hedetniemi, Information Dissemination in Trees, SIAM Journal on Computing, vol.10, issue.4, pp.692-701, 1981.
DOI : 10.1137/0210052

G. Yao, D. Zhu, H. Li, and S. Ma, A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem, Discrete Mathematics, vol.308, issue.17, pp.3951-3959, 2008.
DOI : 10.1016/j.disc.2007.07.105