{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:31Z","timestamp":1759638271493},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,3,14]],"date-time":"2008-03-14T00:00:00Z","timestamp":1205452800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s00446-008-0058-0","type":"journal-article","created":{"date-parts":[[2008,3,13]],"date-time":"2008-03-13T07:05:26Z","timestamp":1205391926000},"page":"117-127","source":"Crossref","is-referenced-by-count":16,"title":["Time efficient k-shot broadcasting in known topology radio networks"],"prefix":"10.1007","volume":"21","author":[{"given":"Leszek","family":"Ga\u0328sieniec","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erez","family":"Kantor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,3,14]]},"reference":[{"key":"58_CR1","doi-asserted-by":"crossref","unstructured":"Amb\u00fchl, C.: An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, pp. 1139\u20131150 (2005)","DOI":"10.1007\/11523468_92"},{"key":"58_CR2","doi-asserted-by":"crossref","unstructured":"Amb\u00fchl, C., Erlebach, T., Mihalak, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proceedings of 9th International Workshop on Approximation Algorithms for Combinatorial Optimisation Problems (APPROX), pp. 3\u201314 (2006)","DOI":"10.1007\/11830924_3"},{"key":"58_CR3","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0022-0000(91)90015-W","volume":"43","author":"N. Alon","year":"1991","unstructured":"Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Comput. Syst. Sci. 43, 290\u2013298 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"58_CR4","doi-asserted-by":"crossref","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcasting in radio networks: an exponential gap between determinism and randomization. In: Proceedings of the 5th Symposium on Principles of Distributed Computing (PODC), pp. 98\u2013107 (1986)","DOI":"10.1145\/41840.41849"},{"key":"58_CR5","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Cooper, C., Hu, Z.: Energy efficient randomised communication in unknown adhoc networks. In: Proceedings of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 250\u2013259 (2007)","DOI":"10.1145\/1248377.1248419"},{"key":"58_CR6","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1109\/26.79285","volume":"39","author":"I. Chlamtac","year":"1991","unstructured":"Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Commun. 39, 426\u2013433 (1991)","journal-title":"IEEE Trans. Commun."},{"key":"58_CR7","doi-asserted-by":"crossref","unstructured":"Cicalese, F., Manne, F., Xin, Q.: Faster centralised communication in radio networks. In: Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC), pp. 339\u2013348 (2006)","DOI":"10.1007\/11940128_35"},{"key":"58_CR8","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: 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\u2013131 (2001)","DOI":"10.1007\/3-540-44693-1_11"},{"key":"58_CR9","unstructured":"Elkin, M., Kortsarz, G.: Improved broadcast schedule for radio networks. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 222\u2013231 (2005)"},{"key":"58_CR10","doi-asserted-by":"crossref","unstructured":"Flammini, M., Navarra, A., Klasing, R., Perennes, S.: Improved approximation results for the minimum energy broadcasting problem. In: Proceedings of the DIALM-POMC Workshop on Foundations of Mobile Computing, pp. 85\u201391 (2004)","DOI":"10.1145\/1022630.1022644"},{"issue":"1","key":"58_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0196-6774(02)00292-4","volume":"46","author":"I. Gaber","year":"2003","unstructured":"Gaber, I., Mansour, Y.: Centralised broadcast in multihop radio networks. J. Algorithms 46(1), 1\u201320 (2003)","journal-title":"J. Algorithms"},{"issue":"4","key":"58_CR12","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s00446-006-0011-z","volume":"19","author":"L. Ga\u0328sieniec","year":"2007","unstructured":"Ga\u0328sieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. Distrib. Comput. 19(4), 289\u2013300 (2007)","journal-title":"Distrib. Comput."},{"issue":"1","key":"58_CR13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.tcs.2007.03.059","volume":"383","author":"L. Ga\u0328sieniec","year":"2007","unstructured":"Ga\u0328sieniec, L., Potapov, I., Xin, Q.: Time efficient centralised gossiping in radio networks. Theor. Comput. Sci. 383(1), 45\u201358 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"58_CR14","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/0406036","volume":"6","author":"M. Goldberg","year":"1993","unstructured":"Goldberg, M., Spencer, T.: An efficient parallel algorithm that finds independent sets of guaranteed size. SIAM J. Discrete Math. 6(3), 443\u2013459 (1993)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"58_CR15","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S. Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374\u2013387 (1998)","journal-title":"Algorithmica"},{"key":"58_CR16","doi-asserted-by":"crossref","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. Inf. Comput. 150, 57\u201374 (1999)","journal-title":"Inf. Comput."},{"key":"58_CR17","first-page":"866","volume":"3042","author":"R. Klasing","year":"2004","unstructured":"Klasing, R., Navarra, A., Papadopoulos, A., Perennes, S.: Adaptive broadcast consumption (ABC), a new heuristic and new bounds for the minimum energy broadcast routing problem. Networking 3042, 866\u2013877 (2004)","journal-title":"Networking"},{"key":"58_CR18","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R., Pelc, A.: Centralised deterministic broadcasting in undirected multi-hop radio networks. In: Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimisation Problems (APPROX), pp. 171\u2013182 (2004)","DOI":"10.1007\/978-3-540-27821-4_16"},{"issue":"3","key":"58_CR19","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s00446-006-0007-8","volume":"19","author":"D.R. Kowalski","year":"2007","unstructured":"Kowalski, D.R., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distrib. Comput. 19(3), 185\u2013195 (2007)","journal-title":"Distrib. Comput."},{"key":"58_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing. Cambridge University Press, Cambridge (2005)"},{"key":"58_CR21","doi-asserted-by":"crossref","unstructured":"Navarra, A.: Tighter bounds for the minimum energy broadcasting problem. In: Proceedings of the 3rd International Symposium on Modeling and Optimisation in Mobile, Ad Hoc and Wireless Networks, pp. 313\u2013322 (2005)","DOI":"10.1109\/WIOPT.2005.51"},{"key":"58_CR22","first-page":"436","volume":"48","author":"P. Turan","year":"1941","unstructured":"Turan, P.: On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"key":"58_CR23","doi-asserted-by":"crossref","unstructured":"Wan, P.J., Calinescu, G., Li, X.Y., Frieder, O.: Minimum-energy broadcast routing in static ad hoc wireless networks. In: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 1162\u20131171 (2001)","DOI":"10.1109\/INFCOM.2001.916310"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0058-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-008-0058-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0058-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:26:37Z","timestamp":1559136397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-008-0058-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,14]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["58"],"URL":"https:\/\/doi.org\/10.1007\/s00446-008-0058-0","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,14]]}}}