1. Ambühl C (2005) An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Proceedings of 32th international colloquium on automata, languages and programming (ICALP). Lecture notes in computer science, vol 3580. Springer, Berlin, pp 1139–1150
2. Clementi A, Crescenzi P, Penna P, Rossi G, Vocca P (2001) On the complexity of computing minimum energy consumption broadcast subgraphs. In: Proceedings of the 18th annual symposium on theoretical aspects of computer science (STACS), pp 121–131
3. Clementi A, Huiban G, Penna P, Rossi G, Verhoeven Y (2002) Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks. In: Proceedings of the 3rd workshop on approximation and randomization algorithms in communication networks (ARACNE), pp 23–38
4. Flammini M, Klasing R, Navarra A, Perennes S (2004) Improved approximation results for the minimum energy broadcasting problem. In: Proceedings of the 2004 joint workshop on foundations of mobile computing
5. Fuchs B (2006) On the hardness of range assignment problems. In: Proceedings of the 6th Italian conference on algorithms and complexity (CIAC), pp 127–138