{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:57:23Z","timestamp":1742381843865,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001423"},{"type":"electronic","value":"9783540361367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36136-7_30","type":"book-chapter","created":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T19:07:11Z","timestamp":1227640031000},"page":"332-343","source":"Crossref","is-referenced-by-count":17,"title":["New Results for Energy-Efficient Broadcasting in Wireless Networks"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[]},{"given":"Panagiotis","family":"Kanellopoulos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"G. C\u0103linescu, I. M\u0103ndoiu, A. Zelikovsky. Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In Proc. of the 2nd IFIP International Conference on Theoretical Computer Science, 2002, to appear.","key":"30_CR1","DOI":"10.1007\/978-0-387-35608-2_11"},{"key":"30_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-44693-1_11","volume-title":"Proc. of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS\u2019 01)","author":"A. E. F. Clementi","year":"2001","unstructured":"A. E. F. Clementi, P. Crescenzi, P. Penna, G. Rossi, P. Vocca. On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In Proc. of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS\u2019 01), LNCS 2010, Springer, pp. 121\u2013131, 2001."},{"doi-asserted-by":"crossref","unstructured":"A. E. F. Clementi, M. Di Ianni, R. Silvestri. The Minimum Broadcast Range Assignment Problem on Linear Multi-Hop Wireless Networks. Theoretical Computer Science, to appear.","key":"30_CR3","DOI":"10.1016\/S0304-3975(02)00538-8"},{"key":"30_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-540-48413-4_21","volume-title":"Proc. of Randomization, Approximation, and Combinatorial Optimization (RANDOM\/APPROX\u2019 99)","author":"A. E. F. Clementi","year":"1999","unstructured":"A. E. F. Clementi, P. Penna, R. Silvestri. Hardness Results for the Power Range Assignment Problem in Packet Radio Networks. In Proc. of Randomization, Approximation, and Combinatorial Optimization (RANDOM\/APPROX\u2019 99), LNCS 1671, Springer, pp. 197\u2013208, 1999."},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/inco.1998.2754","volume":"150","author":"S. Guha","year":"1999","unstructured":"S. Guha, S. Khuller. Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Information and Computation, Vol. 150(1), pp. 57\u201374, 1999.","journal-title":"Information and Computation"},{"issue":"1\u20132","key":"30_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L. M. Kirousis","year":"2000","unstructured":"L. M. Kirousis, E. Kranakis, D. Krizanc, A. Pelc. Power Consumption in Packet Radio Networks. Theoretical Computer Science, Vol. 243(1\u20132), pp. 289\u2013305, 2000.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"P.-J. Wan, G. C\u0103linescu, X.-Y. Li, O. Frieder. Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. In Proc. of IEEE INFOCOM 2001, pp. 1162\u20131171.","key":"30_CR7","DOI":"10.1109\/INFCOM.2001.916310"},{"doi-asserted-by":"crossref","unstructured":"J. E. Wieselthier, G. D. Nguyen, A. Ephremides. On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. In Proc. of IEEE INFOCOM 2000, pp. 585\u2013594.","key":"30_CR8","DOI":"10.1109\/INFCOM.2000.832232"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36136-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T17:06:46Z","timestamp":1738688806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36136-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001423","9783540361367"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-36136-7_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}