1. A. Clementi, P. Crescenzi, P. Penna, G. Rossi and P. Vocca, On the complexity of computing minimum energy consumption broadcast subgraph, in: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS), vol. 2010 of Lecture Notes in Computer Science, Springer-Verlag, (2001) pp. 121–131.
2. A. Clementi, G. Huiban, P. Penna, G. Rossi and Y.C. Verhoeven, On the approximation ratio of the MST-based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks, in: Proceedings of the 3rd IEEE IPDPS Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN) (2003).
3. A.K. Das, R.J. Markas, M. El-Sharkawai, P. Arabshahi and A. Gray, Minimum energy broadcast trees for wireless networks: integer programming formulations, in: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), vol. 2, IEEE Computer Society, (2003) pp. 1001–1010.
4. M. Flammini, R. Klasing, A. Navarra and S. Perennes, Improved approximation results for the minimum energy broadcasting problem, in: Proceedings of ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC) (2004) pp. 85–91.
5. M. Flammini, A. Navarra and S. Perennes, The “Real” approximation factor of the MST heuristic for the minimum energy broadcasting, in: Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms (WEA), vol. 3503 of Lecture Notes in Computer Science, Springer Verlag, (2005) pp. 22–31.