On the complexity of computing minimum energy consumption broadcast subgraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2010, Issue , 2001, Pages 121-131

  Clementi, Andrea E F ^a   Crescenzi, Pilu ^b   Penna, Paolo ^a   Rossi, Gianluca ^b   Vocca, Paola ^a  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b UNIVERSITY OF FLORENCE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; DIRECTED GRAPHS; ENERGY UTILIZATION; OPTIMIZATION; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS); WIRELESS NETWORKS;

BROADCAST OPERATIONS; COMBINATORIAL OPTIMIZATION PROBLEMS; GEOMETRIC SPACE; MINIMUM ENERGY CONSUMPTION; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; RANGE ASSIGNMENT; TRANSMISSION GRAPHS; WEIGHTED DIRECTED GRAPH;

GREEN COMPUTING;

EID: 84957104213     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_11     Document Type: Conference Paper

References (25)

1. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation – Combinatorial optimization problems and their approximability properties. Springer Verlag, 1999.
2. R. Bar-Yehuda, O. Goldreich, and A. Itai. On the time complexity of broadcast operations in multi-hop radio networks: an exponential gap between determinism and randomization. J. Computer and Systems Science, 45:104–126, 1992.
3. R. Bar-Yehuda, A. Israeli, and A. Itai. Multiple communication in multi-hop radio networks. SIAM J. on Computing, 22:875–887, 1993.
4. D. P. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. Prentice Hall, 1994.
5. A.E.F. Clementi, A. Ferreira, P. Penna, S. Perennes, and R. Silvestri. The minimum range assignment problem on linear radio networks. In Proc. 8th Annual European Symposium on Algorithms, volume 1879 of LNCS, pages 143–154, 2000.
6. A.E.F. Clementi, P. Penna, and R. Silvestri. Hardness results for the power range assignment problem in packet radio networks. In Proc. of Randomization, Approximation and Combinatorial Optimization, volume 1671 of LNCS, pages 197–208, 1999. Full version available as ECCC Report TR00-54.
7. A.E.F. Clementi, P. Penna, and R. Silvestri. The power range assignment problem in radio networks on the plane. In Proc. 17th Annual Symposium on Theoretical Aspects of Computer Science, volume 1770 of LNCS, pages 651–660, 2000. Full version available as ECCC Report TR00-54.
8. J.H. Conway and N.J.A. Sloane. Sphere Packings, Lattices and Groups. Springer-Verlag, 1988.
9. B. Dixon, M. Rauch, and R.E. Tarjan. Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM J. Comput., 21:1184–1192, 1992.
10. A. Ephremides. Complicating factors for the use of distributed algorithms in wireless networks. In 1st Int. Workshop on Approximation and Randomized Algorithms in Communication Networks, invited talk, 2000.
11. D. Eppstein. Offline algorithms for dynamic minimum spanning tree problem. J. of Algorithms, 17:237–250, 1994.
12. Z. Haas and S. Tabrizi. On some challenges and design choices in ad hoc communications. In Proc. IEEE MILCOM’98, 1998.
13. G.A. Kabatiansky and V.I. Levenshtein. Bounds for packings on a sphere and in space (in russian). Problemy Peredachi Informatsii, 14(1):3–25, 1978. English translation: Problems of Information Theory, 14(1):1–17, 1978.
14. L.M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc. Power consumption in packet radio networks. Theoretical Computer Science, 243:289–306, 2000.
15. G.S. Lauer. Packet radio routing, chapter 11. Prentice-Hall, 1995.
16. R. Mathar and J. Mattfeldt. Optimal transmission ranges for mobile communication in linear multi-hop packet radio networks. Wireless Networks, 2:329–342, 1996.
17. C. Monma and S. Suri. Transitions in geometric minimum spanning tree. Discrete and Computational Geometry, 8:265–293, 1992.
18. E. Nardelli, G. Proietti, and P. Widmayer. Maintainig a minimum spanning tree under transient node failures. In Proc. 8th Annual European Symposium on Algorithms, to appear, 2000.
19. K. Pahlavan and A. Levesque. Wireless information networks. Wiley-Interscience, 1995.
20. C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
21. P. Piret. On the connectivity of radio networks. IEEE Trans. on Inform. Theory, 37:1490– 1492, 1991.
22. D. Raychaudhuri and N.D. Wilson. ATM-based transport architecture for multiservices wireless personal communication networks. IEEE J. Selected Areas in Communications, 12:1401–1414, 1994.
23. R. Raz and S. Safra. A sub-constant error-probability low-degree test, and sub-constant error-probability pcp characterization of np. In Proc. 29th Ann. ACM Symp. on Theory of Comp., pages 784–798, 1997.
24. S. Ulukus and R.D. Yates. Stocastic power control for cellular radio systems. IEEE Trans. Comm., 46:784–798, 1996.
25. A.D. Wyner. Capabilities of bounded discrepancy decoding. BSTJ, 44:1061–1122, 1965.