{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:20:06Z","timestamp":1773656406511,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/wcnc.2003.1200675","type":"proceedings-article","created":{"date-parts":[[2004,1,23]],"date-time":"2004-01-23T23:33:03Z","timestamp":1074900783000},"page":"1889-1894","source":"Crossref","is-referenced-by-count":39,"title":["Power efficient range assignment in ad-hoc wireless networks"],"prefix":"10.1109","volume":"3","author":[{"given":"E.","family":"Althaus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Calinescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.I.","family":"Mandoiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Prasad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Tchervenski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Zelikovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","author":"lov\ufffdsz","year":"1986","journal-title":"Matching Theory"},{"key":"17","first-page":"770","article-title":"Improved Steiner tree approximation in graphs","author":"robins","year":"2000","journal-title":"Proc 10th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)73429-7"},{"key":"15","article-title":"Better approximation bounds for the network and Euclidean Steiner tree problems","author":"zelikovsky","year":"1996","journal-title":"Department of Computer Science"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01187035"},{"key":"13","author":"tanembaum","year":"1996","journal-title":"Computer Networks"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35608-2_11"},{"key":"11","author":"rappaport","year":"1996","journal-title":"Wireless Communications Principles and Practices"},{"key":"12","article-title":"Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks","author":"clementi","year":"2002","journal-title":"Proc 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE)"},{"key":"21","year":"0","journal-title":"SCIL-Symbolic Constraints for Integer Linear Programming"},{"key":"3","first-page":"121","article-title":"On the complexity of computing minimum energy consumption broadcast subgraphs","author":"clementi","year":"2001","journal-title":"Symposium on Theoretical Aspects of Computer Science"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"2","doi-asserted-by":"crossref","DOI":"10.1023\/A:1015594724700","article-title":"Energy efficient broadcast in mobile ad hoc networks","author":"chu","year":"2002","journal-title":"Proc Ad-Hoc Wireless Networks Symp"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35608-2_7"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832232"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832213"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/513800.513816"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00223-0"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1023\/B:MONE.0000013624.32948.87"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916310"},{"key":"8","article-title":"Power-aware broadcasting in mobile ad hoc networks","author":"singh","year":"1999","journal-title":"Proceedings of IEEE PIMRC"}],"event":{"name":"WCNC 2003 - IEEE Wireless Communications and Networking Conference","location":"New Orleans, LA, USA","acronym":"WCNC-03"},"container-title":["2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8546\/27030\/01200675.pdf?arnumber=1200675","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T23:18:15Z","timestamp":1497568695000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1200675\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/wcnc.2003.1200675","relation":{},"subject":[]}}