Author:
Calamoneri Tiziana,Clementi Andrea E.F.,Di Ianni Miriam,Lauria Massimo,Monti Angelo,Silvestri Riccardo
Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. C. Ambuehl, An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks, in: Proc. of 32th ICALP, 2005, pp. 1139–1150
2. Using a hop-constrained model to generate alternative communication network design;Balakrishnan;ORSA Journal of Computing,1992
3. Minimum-energy broadcasting in static ad hoc wireless networks;Caˇlinescu;Wireless Networks,2002
4. A. Clementi, P. Crescenzi, P. Penna, G. Rossi, P. Vocca, On the complexity of computing minimum energy consumption broadcast subgraphs, in: Proc. of 18th STACS, in: LNCS, vol. 2010, 2001, pp. 121–131
5. A. Clementi, G. Huiban, P. Penna, G. Rossi, 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: Proc. of 3rd IEEE WMAN, 2003
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献