{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:43:17Z","timestamp":1777596197387,"version":"3.51.4"},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001786","name":"University of Adelaide","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001786","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP150104871"],"award-info":[{"award-number":["DP150104871"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Initiative Grant"},{"DOI":"10.13039\/501100002402","name":"Sun Yat-Sen University","doi-asserted-by":"publisher","award":["985"],"award-info":[{"award-number":["985"]}],"id":[{"id":"10.13039\/501100002402","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Mobile Comput."],"published-print":{"date-parts":[[2017,12,1]]},"DOI":"10.1109\/tmc.2017.2696009","type":"journal-article","created":{"date-parts":[[2017,4,19]],"date-time":"2017-04-19T18:19:53Z","timestamp":1492625993000},"page":"3320-3333","source":"Crossref","is-referenced-by-count":18,"title":["Efficient Approximation Algorithms for Multi-Antennae Largest Weight Data Retrieval"],"prefix":"10.1109","volume":"16","author":[{"given":"Longkun","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3663-6591","authenticated-orcid":false,"given":"Hong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenxing","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2005.11.001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/800125.804034"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90246-E"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21711-5"},{"key":"ref14","first-page":"891","article-title":"Efficient data retrieval scheduling for multi-channel wireless\n data broadcast","author":"lu","year":"2012","journal-title":"Proc IEEE InfoCom"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2013.32"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62233"},{"key":"ref17","author":"schrijver","year":"1998","journal-title":"Theory of Linear and Integer Programming"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15251-1_6"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258599"},{"key":"ref6","article-title":"Computer and intractability","author":"garey","year":"1979","journal-title":"A Guide to the Theory of NP-Completeness"},{"key":"ref5","first-page":"1","article-title":"Algebraic data\n retrieval algorithms for multi-channel wireless data broadcast","volume":"497","author":"gao","year":"2011","journal-title":"Theoretical Comput Sci"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/0211045"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2536853.2536879"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90020-1"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.110"},{"key":"ref9","article-title":"Approximating covering and packing problems: Set cover, vertex\n cover, independent set, and related problems","author":"hochbaum","year":"1996","journal-title":"Approximation Algorithms for NP-Hard Problems"}],"container-title":["IEEE Transactions on Mobile Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7755\/8094205\/07904690.pdf?arnumber=7904690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:05:21Z","timestamp":1642003521000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7904690\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,1]]},"references-count":18,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tmc.2017.2696009","relation":{},"ISSN":["1536-1233"],"issn-type":[{"value":"1536-1233","type":"print"}],"subject":[],"published":{"date-parts":[[2017,12,1]]}}}