{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:20:32Z","timestamp":1740133232761,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100003968","name":"Iran National Science Foundation (INSF)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003968","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1109\/tnet.2017.2761191","type":"journal-article","created":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T21:43:34Z","timestamp":1510263814000},"page":"3850-3862","source":"Crossref","is-referenced-by-count":0,"title":["On the Possibility of Network Scheduling With Polynomial Complexity and Delay"],"prefix":"10.1109","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3910-2878","authenticated-orcid":false,"given":"Arsalan","family":"Sharifnassab","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Jamaloddin","family":"Golestani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1109\/ISIT.2007.4557418"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1145\/1374618.1374624"},{"year":"1996","author":"rockafellar","journal-title":"Convex Analysis","key":"ref33"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/INFCOM.2009.5062048"},{"key":"ref31","first-page":"160","article-title":"Approximating discrete collections via local improvements","author":"halld\u00f3rsson","year":"1995","journal-title":"Proc Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref30","first-page":"152","article-title":"Algorithms and complexity","author":"chleb\u00edk","year":"2003","journal-title":"Proc 5th Italian Conf (CIAC)"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1137\/1.9780898718768"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1007\/s10957-007-9335-5"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","volume":"3","author":"shor","year":"1985","journal-title":"Minimization Methods for Non-Differentiable Functions"},{"year":"2003","author":"bertsekas","journal-title":"Convex Analysis and Optimization","key":"ref34"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/9.182479"},{"year":"2006","author":"georgiadis","journal-title":"Resource Allocation and Cross-Layer Control in Wireless Networks","key":"ref11"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/INFCOM.1998.665071"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1145\/1140103.1140283"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/TNET.2009.2021609"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/INFCOM.2007.65"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/TNET.2009.2035046"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1109\/TNET.2011.2177101","article-title":"Q-CSMA: Queue-length-based CSMA\/CA algorithms for achieving maximum throughput and low delay in wireless networks","volume":"20","author":"ni","year":"2012","journal-title":"IEEE\/ACM Trans Netw"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1145\/380752.380839"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1016\/0012-365X(90)90358-O"},{"year":"1979","author":"michael","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","key":"ref28"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/INFOCOM.2006.238"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/TIT.2007.903141"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/INFCOM.2009.5062259"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TIT.2011.2178150"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1007\/3-540-60220-8_84"},{"key":"ref5","volume":"24","author":"pinedo","year":"2005","journal-title":"Planning and Scheduling in Manufacturing and Services"},{"key":"ref8","volume":"3","author":"brucker","year":"2007","journal-title":"Scheduling Algorithms"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1007\/978-3-662-00074-8"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"1452","DOI":"10.1109\/JSAC.2006.879351","article-title":"A tutorial on cross-layer optimization in wireless networks","volume":"24","author":"lin","year":"2006","journal-title":"IEEE J Sel Areas Commun"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1145\/1288107.1288122"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/TIT.2011.2168897"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1145\/185675.306789"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1007\/s00493-003-0037-9"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1017\/CBO9780511804090"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1137\/0218077"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.4153\/CJM-1965-045-4"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/TNET.2004.842226"},{"year":"2001","author":"vazirani","journal-title":"Approximation Algorithms","key":"ref25"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8214923\/08103035.pdf?arnumber=8103035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:25:53Z","timestamp":1642004753000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8103035\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":39,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2017.2761191","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2017,12]]}}}