{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:59:55Z","timestamp":1772726395877,"version":"3.50.1"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1109\/milcom.2016.7795435","type":"proceedings-article","created":{"date-parts":[[2016,12,26]],"date-time":"2016-12-26T16:49:56Z","timestamp":1482770996000},"page":"849-854","source":"Crossref","is-referenced-by-count":4,"title":["Budget constrained relay node placement problem for maximal \u201cconnectedness\u201d"],"prefix":"10.1109","author":[{"given":"Anisha","family":"Mazumder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Chenyang Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arun","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arunabha","family":"Sen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TMC.2009.161","article-title":"Fault-tolerant relay node placement in heterogeneous wireless sensor networks","volume":"9","author":"han","year":"2010","journal-title":"Mobile Computing IEEE Transactions on"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"1649","DOI":"10.1109\/INFCOM.2007.193","article-title":"Fault-tolerant relay node placement in wireless sensor networks: Problems and algorithms","author":"zhang","year":"2007","journal-title":"INFOCOM 2007 26th IEEE International Conference on Computer Communications IEEE"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796309764"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2015.000013"},{"key":"ref11","first-page":"2","article-title":"Polynomial time approximation schemes for euclidean tsp and other geometric problems","author":"arora","year":"1996","journal-title":"Foundations of Computer Science 1996 Proceedings 37th Annual Symposium on"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2033273"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0479-2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00201-4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3390\/s141222564"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225066"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008384012064"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.250629"}],"event":{"name":"MILCOM 2016 - 2016 IEEE Military Communications Conference (MILCOM)","location":"Baltimore, MD, USA","start":{"date-parts":[[2016,11,1]]},"end":{"date-parts":[[2016,11,3]]}},"container-title":["MILCOM 2016 - 2016 IEEE Military Communications Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7784513\/7795145\/07795435.pdf?arnumber=7795435","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T02:49:08Z","timestamp":1498358948000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7795435\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/milcom.2016.7795435","relation":{},"subject":[],"published":{"date-parts":[[2016,11]]}}}