{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T05:57:22Z","timestamp":1772690242016,"version":"3.50.1"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["LP140100670"],"award-info":[{"award-number":["LP140100670"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2894117","type":"journal-article","created":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T22:47:20Z","timestamp":1548197240000},"page":"14847-14858","source":"Crossref","is-referenced-by-count":12,"title":["Minimum-Cost Heterogeneous Node Placement in Wireless Sensor Networks"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3730-8538","authenticated-orcid":false,"given":"Yahui","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saman","family":"Halgamuge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2007.05.003"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00407-013-0127-z"},{"key":"ref12","first-page":"1","article-title":"The node-weighted Steiner tree approach to identify elements of cancer-related signaling pathways","volume":"18","author":"sun","year":"2017","journal-title":"Bioinformatics"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.126"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010302"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00090-0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/040610891"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704445718"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0660-x"},{"key":"ref19","article-title":"The fast heuristic algorithms and post-processing techniques to design large and low-cost communication networks","author":"sun","year":"0","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2011.021611.100123"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2011.6115530"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2024941"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2017.0788"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2677448"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2658598"},{"key":"ref8","article-title":"Classical, prize-collecting node-weighted Steiner tree problems graphs","author":"sun","year":"2018"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2033273"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2015.2458015"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.12.046"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2016.06.003"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230170102"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-016-0111-0"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.2307\/2324749"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"ref25","first-page":"760","article-title":"The prize collecting Steiner tree problem: Theory and practice","author":"johnson","year":"2000","journal-title":"Proc SODA"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08621004.pdf?arnumber=8621004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T08:05:03Z","timestamp":1643270703000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8621004\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2894117","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}