{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T05:49:22Z","timestamp":1748929762667,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1109\/wcnc.2017.7925669","type":"proceedings-article","created":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T17:39:45Z","timestamp":1494610785000},"page":"1-6","source":"Crossref","is-referenced-by-count":7,"title":["Exact Algorithms for Maximizing Lifetime of WSNs Using Integer Linear Programming"],"prefix":"10.1109","author":[{"given":"Xinshu","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojun","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2015.09.012"},{"key":"ref11","article-title":"Efficient algorithms for graph manipulation","author":"hopcroft","year":"1971","journal-title":"Communications of the ACM"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/322358.322367"},{"journal-title":"LP solve","year":"0","key":"ref13"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.12785\/amis\/070508"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-014-0784-0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2015.0688"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2045896"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848071"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2629662"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","article-title":"Bounds on backtrack algorithms for listing cycles, paths and spanning trees","volume":"5","author":"read","year":"1975","journal-title":"Networks"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498455"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2014.2322356"}],"event":{"name":"2017 IEEE Wireless Communications and Networking Conference (WCNC)","start":{"date-parts":[[2017,3,19]]},"location":"San Francisco, CA, USA","end":{"date-parts":[[2017,3,22]]}},"container-title":["2017 IEEE Wireless Communications and Networking Conference (WCNC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7924448\/7925429\/07925669.pdf?arnumber=7925669","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T11:37:57Z","timestamp":1569325077000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7925669\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/wcnc.2017.7925669","relation":{},"subject":[],"published":{"date-parts":[[2017,3]]}}}