{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:53:42Z","timestamp":1742403222739},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1109\/infcom.2010.5462068","type":"proceedings-article","created":{"date-parts":[[2010,5,12]],"date-time":"2010-05-12T20:54:40Z","timestamp":1273697680000},"page":"1-6","source":"Crossref","is-referenced-by-count":5,"title":["Minimum Power Energy Spanners in Wireless Ad Hoc Networks"],"prefix":"10.1109","author":[{"given":"A. Karim","family":"Abu-Affash","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rom","family":"Aschner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paz","family":"Carmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/26.20105"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00223-0"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-540-48413-4_21","article-title":"Hardness results for the power range assignmet problem in packet radio networks","author":"clementi","year":"1999","journal-title":"Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM-APPROX'99)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02189308"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195995000088"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195997000193"},{"key":"ref16","first-page":"215","article-title":"A new way to weigh malnourished Euclidean graphs","author":"das","year":"1995","journal-title":"Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-006-5980-0"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","article-title":"Computational Geometry: Algorithms and Applications","author":"berg","year":"2008"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/332833.332838"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/35.894385"},{"article-title":"Wireless information networks","year":"1995","author":"pahlavan","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/2.869369"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.05.019"},{"article-title":"Wireless communications: principles and practice","year":"1996","author":"rappaport","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/313451.313556"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061918"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369387"}],"event":{"name":"IEEE INFOCOM 2010 - IEEE Conference on Computer Communications","start":{"date-parts":[[2010,3,14]]},"location":"San Diego, CA, USA","end":{"date-parts":[[2010,3,19]]}},"container-title":["2010 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5461675\/5461899\/05462068.pdf?arnumber=5462068","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,4]],"date-time":"2020-06-04T15:27:04Z","timestamp":1591284424000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5462068\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/infcom.2010.5462068","relation":{},"subject":[],"published":{"date-parts":[[2010,3]]}}}