{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:20:46Z","timestamp":1767651646174,"version":"3.43.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Networks"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1023\/a:1020381720601","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T08:44:30Z","timestamp":1047717870000},"page":"607-617","source":"Crossref","is-referenced-by-count":145,"title":["Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks"],"prefix":"10.1007","volume":"8","author":[{"given":"P.-J.","family":"Wan","sequence":"first","affiliation":[]},{"given":"G.","family":"C\u0103linescu","sequence":"additional","affiliation":[]},{"given":"X.-Y.","family":"Li","sequence":"additional","affiliation":[]},{"given":"O.","family":"Frieder","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"5095784_CR1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"V. Chv\u00e1tal, A greedy heuristic for the set-covering problem, Mathematics of Operations Research 4(3) (1979) 233\u2013235.","journal-title":"Mathematics of Operations Research"},{"key":"5095784_CR2","doi-asserted-by":"crossref","unstructured":"A. Clementi, P. Crescenzi, P. Penna, G. Rossi and P. Vocca, On the complexity of computing minimum energy consumption broadcast subgraphs, in: 18th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 2010 (2001) pp. 121\u2013131.","DOI":"10.1007\/3-540-44693-1_11"},{"key":"5095784_CR3","doi-asserted-by":"crossref","unstructured":"A. Clementi, P. Penna and R. Silvestri, On the power assignment problem in radio networks, in: Electronic Colloquium on Computational Complexity (2000). Preliminary results in: APPROX'99 and STACS'2000.","DOI":"10.1007\/3-540-46541-3_54"},{"key":"5095784_CR4","unstructured":"T.J. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press and McGraw-Hill, 1990)."},{"key":"5095784_CR5","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, 1979)."},{"key":"5095784_CR6","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/PL00009201","volume":"20","author":"S. Guha","year":"1998","unstructured":"S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica 20 (1998) 347\u2013387.","journal-title":"Algorithmica"},{"key":"5095784_CR7","doi-asserted-by":"crossref","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 and A. Pelc, Power consumption in packet radio networks, Theoretical Computer Science 243 (2000) 289\u2013305.","journal-title":"Theoretical Computer Science"},{"key":"5095784_CR8","doi-asserted-by":"crossref","unstructured":"F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction (Springer-Verlag, 1985).","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"5095784_CR9","unstructured":"T.S. Rappaport, Wireless Communications: Principles and Practices (Prentice Hall, 1996)."},{"key":"5095784_CR10","unstructured":"S. Singh, C.S. Raghavendra and J. Stepanek, Power-aware broadcasting in mobile ad hoc networks, in: Proceedings of IEEE PIMRC'99, Osaka, Japan (September 1999)."},{"key":"5095784_CR11","unstructured":"J.E. Wieselthier, G.D. Nguyen and A. Ephremides, On the construction of energy-efficient broadcast and multicast trees in wireless networks, in: IEEE Infocom'2000 (2000)."}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020381720601.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020381720601\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020381720601.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T12:08:01Z","timestamp":1755086881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020381720601"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["5095784"],"URL":"https:\/\/doi.org\/10.1023\/a:1020381720601","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"type":"print","value":"1022-0038"},{"type":"electronic","value":"1572-8196"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}