{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:20:49Z","timestamp":1740133249654,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1109\/tnet.2022.3179451","type":"journal-article","created":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T19:34:04Z","timestamp":1654716844000},"page":"2521-2530","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Aggregate Utility Maximization Using Greedy Maximal Scheduling"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7229-7059","authenticated-orcid":false,"given":"Reena","family":"Chackochan","sequence":"first","affiliation":[{"name":"Department of Electronics and Communication Engineering, M. S. Ramaiah Institute of Technology, Bengaluru, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7488-3641","authenticated-orcid":false,"given":"Albert","family":"Sunny","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology at Palakkad, Palakkad, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5097-8651","authenticated-orcid":false,"given":"Senthilkumar","family":"Dhanasekaran","sequence":"additional","affiliation":[{"name":"Department of Electronics and Communication Engineering, M. S. Ramaiah Institute of Technology, Bengaluru, India"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498496"},{"key":"ref11","first-page":"1","article-title":"Cross-layer congestion control, routing and scheduling design in ad hoc wireless networks","author":"chen","year":"2006","journal-title":"Proc IEEE InfoCom"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879361"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2018.2864091"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/COMSNETS.2009.4808867"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2011.2157544"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354673"},{"key":"ref17","first-page":"5342","article-title":"Regulated maximal matching: A distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharing","author":"wu","year":"2005","journal-title":"Proc 44th IEEE Conf Decis Control"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2007.1061"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2551486"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.872546"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1161089.1161116"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913537"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2010.5683487"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1038\/sj.jors.2600523"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.890121"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.837590"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1089444.1089497"},{"key":"ref1","first-page":"202","article-title":"Scheduling for multiple flows sharing a time-varying channel: The exponential rule","volume":"2","author":"shakkottai ansd a l stolyar","year":"2000","journal-title":"Amer Math Soc Transl"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-1334-2"},{"journal-title":"Nonlinear Programming","year":"2003","author":"bertsekas","key":"ref21"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1109\/TNET.2009.2026276","article-title":"Understanding the capacity region of the greedy maximal scheduling algorithm in multihop wireless networks","volume":"17","author":"joo","year":"2009","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/070708111"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/9990997\/09790861.pdf?arnumber=9790861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T19:19:04Z","timestamp":1673896744000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9790861\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":24,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2022.3179451","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2022,12]]}}}