{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T11:11:51Z","timestamp":1692616311852},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2011,4,1]],"date-time":"2011-04-01T00:00:00Z","timestamp":1301616000000},"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\/ACM Trans. Networking"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/tnet.2010.2064175","type":"journal-article","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T18:53:40Z","timestamp":1285008820000},"page":"447-455","source":"Crossref","is-referenced-by-count":15,"title":["Scheduling Algorithms for Multicarrier Wireless Data Systems"],"prefix":"10.1109","volume":"19","author":[{"given":"Matthew","family":"Andrews","sequence":"first","affiliation":[]},{"given":"Lisa","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","author":"tse","year":"2001","journal-title":"Multiuser diversity in wireless networks"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.212277"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555364"},{"key":"ref11","first-page":"213","article-title":"A PTAS for the multiple knapsack problem","author":"chekuri","year":"2000","journal-title":"Proc Annu ACM-SIAM Symp Discrete Algorithm"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498459"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BFb0121195","article-title":"An analysis of approximations for maximizing submodular set functions-II","volume":"8","author":"fisher","year":"1978","journal-title":"Math Program Studies"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109624"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743463"},{"key":"ref16","first-page":"346","author":"hochbaum","year":"1995","journal-title":"Approximation Algorithms for NP-Hard Problems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/VETECS.2000.851593"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90246-E"},{"key":"ref19","first-page":"1051","article-title":"Asymptotic properties of proportional-fair sharing algorithms","author":"kushner","year":"2002","journal-title":"Proc 40th Annu Allerton Conf Commun Control Comput"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0156"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/35.900644"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-005-1450-0"},{"key":"ref3","author":"andrews","year":"2000","journal-title":"CDMA data QoS scheduling on the forward link with variable channel conditions"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.105"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498527"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062042"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.882835"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2004.833419"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/35.852034"},{"key":"ref1","first-page":"1532","article-title":"Optimality of certain channel aware scheduling policies","author":"agrawal","year":"2002","journal-title":"Proc 40th Annu Allerton Conf Commun Control Comput"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062197"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(02)00401-2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/49.957318"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019396"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498453"},{"key":"ref26","first-page":"185","article-title":"Scheduling for multiple flows sharing a time-varying channel: The exponential rule","volume":"207","author":"shakkottai","year":"2002","journal-title":"Anal Meth Appl Prob"},{"key":"ref25","first-page":"793","article-title":"Scheduling algorithms for a mixture of real-time and non-real-time data in HDR","author":"shakkottai","year":"2001","journal-title":"Proc 17th ITC"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/90\/5750164\/05575386.pdf?arnumber=5575386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:43:48Z","timestamp":1633913028000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5575386\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":31,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2010.2064175","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4]]}}}