{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:07:53Z","timestamp":1742389673466},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_37","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T15:01:54Z","timestamp":1283958114000},"page":"418-427","source":"Crossref","is-referenced-by-count":19,"title":["Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Amb\u00fchl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea E. F.","family":"Clementi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miriam","family":"Di Ianni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nissan","family":"Lev-Tov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Monti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluca","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R. Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the Time Complexity of Broadcast Operations in Multi-Hop Radio Networks: An Exponential Gap Between Determinism and Randomization. J. of Computer and Systems Science\u00a045, 104\u2013126 (1992)","journal-title":"J. of Computer and Systems Science"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1137\/0222055","volume":"22","author":"R. Bar-Yehuda","year":"1993","unstructured":"Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple Communication in Multi-Hop Radio Networks. SIAM J. on Computing\u00a022, 875\u2013887 (1993)","journal-title":"SIAM J. on Computing"},{"key":"37_CR3","unstructured":"C\u01celinescu, G., Li, X.Y., Frieder, O., Wan, P.J.: Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. In: Proc. 20th Joint Conf. of IEEE Computer and Communications Societies (INFOCOM), pp. 1162\u20131171 (2001)"},{"key":"37_CR4","unstructured":"Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: A Worst-case Analysis of an MST-based Heuristic to Construct Energy-Efficient Broadcast Trees in Wireless Networks. In: Proc. 3th Workshop on Wireles, Mobile and Ad-Hoc Networks, WMAN-IPDPS (2003)"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44693-1_11","volume-title":"STACS 2001","author":"A.E.F. Clementi","year":"2001","unstructured":"Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 121\u2013131. Springer, Heidelberg (2001)"},{"key":"37_CR6","unstructured":"Clementi, A.E.F., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks. In: Proc. 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), pp. 23\u201338 (2002)"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1016\/S0304-3975(02)00538-8","volume":"299","author":"A.E.F. Clementi","year":"2003","unstructured":"Clementi, A.E.F., Di Ianni, M., Silvestri, R.: The Minimum Broadcast Range Assignment Problem on Linear Multi-Hop Wireless Networks. Theoretical Computer Science\u00a0299, 751\u2013761 (2003)","journal-title":"Theoretical Computer Science"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-540-48413-4_21","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"A.E.F. Clementi","year":"1999","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: Hardness Results for the Power Range Assignment Problem in Packet Radio Networks. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol.\u00a01671, pp. 197\u2013208. Springer, Heidelberg (1999)"},{"key":"37_CR9","unstructured":"Ephremides, A., Nguyen, G.D., Wieselthier, J.E.: On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. In: Proc. 19th Joint Conf. of IEEE Computer and Communications Societies (INFOCOM), pp. 585\u2013594 (2000)"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/inco.1998.2754","volume":"150","author":"S. Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Information and Computation\u00a0150, 57\u201374 (1999)","journal-title":"Information and Computation"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Haas, Z., Tabrizi, S.: On Some Challenges and Design Choices in Ad-Hoc Communications. In: Proc. IEEE Military Communication Conf., MILCOM (1998)","DOI":"10.1109\/MILCOM.1998.722569"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L.M. Kirousis","year":"2000","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power Consumption in Packet Radio Networks. Theoretical Computer Science\u00a0243, 289\u2013305 (2000)","journal-title":"Theoretical Computer Science"},{"key":"37_CR13","first-page":"351","volume-title":"Routing in communication networks, ch. 11","author":"G.S. Lauer","year":"1995","unstructured":"Lauer, G.S.: Packet radio routing. In: Streenstrup, M. (ed.) Routing in communication networks, ch. 11, pp. 351\u2013396. Prentice-Hall, Englewood Cliffs (1995)"},{"key":"37_CR14","volume-title":"Wireless information networks","author":"K. Pahlavan","year":"1995","unstructured":"Pahlavan, K., Levesque, A.: Wireless information networks. Wiley-Interscience, Hoboken (1995)"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. In: Proc. 29th ACM Symp. on Theory of Computing (STOC), 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"},{"key":"37_CR16","volume-title":"Davenport-Schinzel Sequences and Their Geometric Applications","author":"M. Sharir","year":"1995","unstructured":"Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge (1995)"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T01:21:57Z","timestamp":1553044917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}