{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T00:22:40Z","timestamp":1704846160998},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T00:00:00Z","timestamp":1283299200000},"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":[[2010,9]]},"DOI":"10.1109\/tit.2010.2053902","type":"journal-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T14:46:04Z","timestamp":1282229164000},"page":"4417-4437","source":"Crossref","is-referenced-by-count":11,"title":["On Resource Allocation in Fading Multiple-Access Channels\u2013An Efficient Approximate Projection Approach"],"prefix":"10.1109","volume":"56","author":[{"given":"Ali","family":"ParandehGheibi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atilla","family":"Eryilmaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asuman","family":"Ozdaglar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muriel","family":"Medard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","author":"nedi","year":"2000","journal-title":"Convergence Rate of Incremental Subgradient Algorithms"},{"key":"ref32","author":"parandehgheibi","year":"2008","journal-title":"Fair resource allocation in multiple access channels"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72792-7_19"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579273"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.3.367"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2329-1"},{"key":"ref10","first-page":"1532","article-title":"optimality of certain channel aware scheduling policies","author":"subramanian","year":"2002","journal-title":"Proc Allerton Conf Commun Control Comput"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0156"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.485709"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498460"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-005-1450-0"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1109\/INFCOM.2007.65","article-title":"polynomial complexity algorithms for full utilization of multi-hop wireless networks","author":"eryilmaz","year":"2007","journal-title":"Proc IEEE InfoCom"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.665071"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1140103.1140283"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2013621"},{"key":"ref19","first-page":"1128","article-title":"performance limits of greedy maximal matching in multi-hop wireless networks","author":"joo","year":"2007","journal-title":"Proc IEEE Conf Decision Control"},{"key":"ref28","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref4","first-page":"265","article-title":"joint scheduling and resource allocation in ofdm systems: algorithms and performance for the uplink","author":"huang","year":"2007","journal-title":"Proc 41st Annu Asilomar Conf Signals Syst Comput"},{"key":"ref27","author":"bertsekas","year":"2003","journal-title":"Convex Analysis and Optimization"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/25.832982"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/49.414637"},{"key":"ref29","author":"brnnlund","year":"1993","journal-title":"On Relaxation Methods for Nonsmooth Convex Optimization"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.737513"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498459"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-8216-3","author":"srikant","year":"2004","journal-title":"Mathematics of Internet Congestion Control"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2003.814348"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498453"},{"key":"ref1","author":"wang","year":"2005","journal-title":"Energy-efficient resource allocation in time division multiple-access over fading channels"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2008.4558652"},{"key":"ref22","first-page":"140","article-title":"delay optimal rate allocation in multiaccess fading communications","author":"yeh","year":"2004","journal-title":"Proc Allerton Conf Commun Control Comput"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/VETECS.2001.944129"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557669"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2006.587"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.641553"},{"key":"ref25","author":"liao","year":"1972","journal-title":"Multiple access channels"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5550275\/05550290.pdf?arnumber=5550290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:46:36Z","timestamp":1633913196000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5550290\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":35,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2053902","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}