{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:17:13Z","timestamp":1759331833418,"version":"3.37.3"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["62172455"],"award-info":[{"award-number":["62172455"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Pearl River Talent Program","award":["2019QN01X140"],"award-info":[{"award-number":["2019QN01X140"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1109\/tnet.2021.3138940","type":"journal-article","created":{"date-parts":[[2022,1,5]],"date-time":"2022-01-05T20:33:34Z","timestamp":1641414814000},"page":"1193-1202","source":"Crossref","is-referenced-by-count":4,"title":["Downlink Transmission Scheduling With Data Sharing"],"prefix":"10.1109","volume":"30","author":[{"given":"Hehuan","family":"Shi","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7943-3172","authenticated-orcid":false,"given":"Lin","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737526"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S1388-3437(01)80151-7"},{"key":"ref3","first-page":"1","article-title":"Optimality of certain channel aware scheduling policies","volume-title":"Proc. Allerton","author":"Agrawal"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/35.900644"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1497290.1497294"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799354138"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18318-8_7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2908906"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/11560586_21"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147956"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(00)00061-4"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/T-WC.2009.071266"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486161"},{"key":"ref14","first-page":"1050","article-title":"New approximations for broadcast scheduling via variants of $\\alpha$\n-point rounding","volume-title":"Proc. ACM-SIAM SODA","author":"Im"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2873606"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848162"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/90.879343"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2191157"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MICC.2009.5431383"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2614794"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2005.1494854"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2010.5506251"},{"article-title":"Combinatorial optimization: Polyhedra and efficiency","volume-title":"Algorithms and Combinatorics","author":"Schrijver","key":"ref23"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3138991"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2004.1311850"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0156"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2018.8422089"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/11809678_34"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2699958"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/9797041\/09669991.pdf?arnumber=9669991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T22:29:53Z","timestamp":1705184993000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9669991\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6]]},"references-count":29,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2021.3138940","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2022,6]]}}}