1. M. Čagalj, J.-P. Hubaux and C. Enz, Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues, in: Proceedings of the 8th Annual International Conference on Mobile Computing and Networks (MOBICOM 2002), Atlanta, GA (September 2002) pp. 172–182.
2. J. Chang and L. Tassiulas, Energy conserving routing in wireless ad-hoc networks, in: Proceedings of IEEE INFOCOM 2000 (ACM, 2000) pp. 22–31.
3. A. Clementi, P. Crescenzi, P. Penna, G. Rossi and P. Vocca, On the complexity of computing minimum energy consumption broadcast subgraphs, in: Proceedings of 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001) (2001) pp. 121–131.
4. T. Cormen, C. Leiserson, R. Rivest and C. Stein, Introduction to Algorithms, 2nd ed. (MIT Press, 2001).
5. O. Eğecioğlu and T. Gonzalez, Minimum-energy broadcast in simple graphs with limited node power, in: Proceedings of IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2001), Anaheim, CA (August 2001) pp. 334–338.