{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:23:14Z","timestamp":1725495794232},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/iwcmc.2013.6583532","type":"proceedings-article","created":{"date-parts":[[2013,8,29]],"date-time":"2013-08-29T19:31:30Z","timestamp":1377804690000},"page":"41-46","source":"Crossref","is-referenced-by-count":2,"title":["Delay analysis of the approximate maximum weight scheduling in wireless networks"],"prefix":"10.1109","author":[{"given":"Cem","family":"Boyaci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ye","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90058-8"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916303"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00312-0"},{"key":"13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0163-9","author":"godsil","year":"2001","journal-title":"Algebraic Graph Theory"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/9.341782"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462087"},{"journal-title":"Introduction to Graph Theory (2nd Edition)","year":"2000","author":"west","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2032181"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062159"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1374618.1374624"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2026276"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019350"},{"key":"5","article-title":"Analysis of scheduling algorithms that provide 100% throughput in input-queued switches","author":"keslassy","year":"2001","journal-title":"Proc of Allerton Conference on Communication Control and Computing"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.665071"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1239\/aap\/1151337082"},{"key":"8","first-page":"28","article-title":"Throughput guarantees through maximal scheduling in wireless networks","author":"chaporkar","year":"2005","journal-title":"Proc of Allerton Conference on Communication Control and Computing"}],"event":{"name":"2013 9th International Wireless Communications and Mobile Computing Conference (IWCMC 2013)","start":{"date-parts":[[2013,7,1]]},"location":"Sardinia, Italy","end":{"date-parts":[[2013,7,5]]}},"container-title":["2013 9th International Wireless Communications and Mobile Computing Conference (IWCMC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6578011\/6583517\/06583532.pdf?arnumber=6583532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T20:58:38Z","timestamp":1498078718000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6583532\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/iwcmc.2013.6583532","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}