{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:18:53Z","timestamp":1753600733995,"version":"3.37.3"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["12141108","62171399"],"award-info":[{"award-number":["12141108","62171399"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010877","name":"Shenzhen Science and Technology Innovation Committee","doi-asserted-by":"publisher","award":["JCYJ20180508162604311"],"award-info":[{"award-number":["JCYJ20180508162604311"]}],"id":[{"id":"10.13039\/501100010877","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1109\/tit.2023.3324180","type":"journal-article","created":{"date-parts":[[2023,10,13]],"date-time":"2023-10-13T17:53:28Z","timestamp":1697219608000},"page":"1852-1875","source":"Crossref","is-referenced-by-count":1,"title":["Wireless Network Scheduling With Discrete Propagation Delays: Theorems and Algorithms"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1987-5643","authenticated-orcid":false,"given":"Shenghao","family":"Yang","sequence":"first","affiliation":[{"name":"School of Science and Engineering, The Chinese University of Hong Kong (Shenzhen), Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Ma","sequence":"additional","affiliation":[{"name":"QIANHAI FOF, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanxiao","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/0471219282.eot409"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062103"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2011.5779160"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161914"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JOE.2012.2203060"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/UComms.2016.7583429"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2017.8254527"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/OCEANSE.2019.8867212"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.21215"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/26.52656"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1161089.1161116"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2532378.2532380"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834878"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2671490.2674472"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s12083-020-01058-2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JOE.2014.2323365"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.3390\/technologies7020043"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056928"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/938985.938993"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879351"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2007.1061"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913537"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.272452"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/25.669084"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2011.2176520"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2016.2547862"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3059719"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807213"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/0204007"},{"issue":"1","key":"ref31","first-page":"526","article-title":"Multilevel hypergraph partitioning: Application in VLSI domain","volume-title":"Proc. ACM\/IEEE Design Autom. Conf","volume":"7","author":"Karypis"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-48413-4_3"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1100.0337"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)90045-P"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-566780-7.50022-2"},{"article-title":"Matchings and flows in hypergraphs","year":"2019","author":"Beckenbach","key":"ref36"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/BF02760024"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1200"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1009\/YNET.2006.872546"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/aict-iciw.2006.22"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.010"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2543629"},{"key":"ref45","first-page":"212","article-title":"Parallel search for maximal independence given minimal dependence","volume-title":"Proc. 1st Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Beame"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90228-N"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612670"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4"},{"issue":"2","key":"ref49","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","volume":"24","author":"Schrijver","year":"2003"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0019-9"},{"volume-title":"An Optimized Graphs Package for the Julia Programming Language","year":"2023","key":"ref51"},{"volume-title":"A Benchmarking Framework for the Julia Language","year":"2023","key":"ref52"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10438985\/10285541.pdf?arnumber=10285541","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T09:35:53Z","timestamp":1709372153000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10285541\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":52,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3324180","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2024,3]]}}}