{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:18:12Z","timestamp":1761743892986},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2014,2,1]],"date-time":"2014-02-01T00:00:00Z","timestamp":1391212800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1109\/tit.2013.2292065","type":"journal-article","created":{"date-parts":[[2014,1,24]],"date-time":"2014-01-24T20:14:39Z","timestamp":1390594479000},"page":"1083-1100","source":"Crossref","is-referenced-by-count":38,"title":["Minimum-Time Link Scheduling for Emptying Wireless Systems: Solution Characterization and Algorithmic Framework"],"prefix":"10.1109","volume":"60","author":[{"given":"Vangelis","family":"Angelakis","sequence":"first","affiliation":[]},{"given":"Anthony","family":"Ephremides","sequence":"additional","affiliation":[]},{"given":"Qing","family":"He","sequence":"additional","affiliation":[]},{"given":"Di","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","author":"proakis","year":"2000","journal-title":"Digital Communications"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.1990.117532"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/90.222924"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1540343.1540347"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935307"},{"key":"ref10","author":"capone","year":"2013","journal-title":"Mobile Ad Hoc Networking The Cutting Directions"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2011.030311.100777"},{"key":"ref12","author":"chen","year":"2010","journal-title":"Applied Integer Programming Modeling and Solution"},{"key":"ref13","author":"chr\ufffdtienne","year":"1995","journal-title":"Scheduling Theory and Its Applications"},{"key":"ref14","author":"eckhoff","year":"1993","journal-title":"Handbook of Convex Geometry"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/9.35806"},{"key":"ref16","author":"fourer","year":"2002","journal-title":"AMPL A Modeling Language for Mathematical Programming"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1561\/1300000001"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511841224"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1288107.1288122"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1561\/1300000030"},{"key":"ref4","author":"bertsimas","year":"1997","journal-title":"Introduction to Linear Optimization"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2008.4558604"},{"key":"ref3","author":"bazaraa","year":"1990","journal-title":"Linear Programming and Network Flows"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208919"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/12.21132"},{"key":"ref5","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883617"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2003.09.002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056928"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462087"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062048"},{"key":"ref20","first-page":"1435","article-title":"A comparison of access methods for multihop ad hoc radio networks","author":"gr\ufffdnkvist","year":"2000","journal-title":"Proc IEEE 51st VTC"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.13.2.157.10520"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.21215"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/185675.306789"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2048338"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2008.4753591"},{"key":"ref25","author":"murty","year":"1983","journal-title":"Linear Programming"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6714461\/06675072.pdf?arnumber=6675072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:31:38Z","timestamp":1642005098000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6675072\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2]]},"references-count":35,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2292065","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2]]}}}