{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:41:21Z","timestamp":1729640481550,"version":"3.28.0"},"reference-count":45,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/infcom.2011.5934887","type":"proceedings-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T14:59:10Z","timestamp":1310050750000},"page":"1116-1124","source":"Crossref","is-referenced-by-count":5,"title":["Approximation algorithms for throughput maximization in wireless networks with delay constraints"],"prefix":"10.1109","author":[{"given":"Guanhong","family":"Pei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. S.","family":"Anil Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasan","family":"Parthasarathy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1313277"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1016\/j.comcom.2004.07.024","article-title":"Performance of wireless networks with hidden nodes: A queueing-theoretic analysis","volume":"28","author":"ray","year":"2005","journal-title":"Journal of Computer Communications"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2008232"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.134"},{"key":"ref30","article-title":"Schedulability criterion and performance analysis of coordinated schedulers","author":"li","year":"2001","journal-title":"ITC"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/90.222924"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/90.298432"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913537"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847717"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90358-O"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1239\/jap\/1134587823"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.905154"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354518"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1996.497883"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1561\/1300000001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.801403"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062162"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301262"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062069"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.32"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700379760"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749305"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2009.5054751"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.661496"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_59"},{"key":"ref29","article-title":"Coordinated network scheduling: A framework for end-to-end services","author":"li","year":"2000","journal-title":"IEEE ICNP"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062069"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2007.12.001"},{"journal-title":"Network Flows Theory Algorithms and Applications","year":"1993","author":"ahuja","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.170"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-008-0001-1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1976.1093299"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2008.04.010"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462012"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1375457.1375502"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/1080829.1080837","article-title":"Characterizing the capacity region in multi-radio multi-channel wireless mesh networks","author":"kodialam","year":"2005","journal-title":"Mobicom"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354532"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.1109\/INFCOM.2009.5062159","article-title":"Asymptotically tight delay guarantees through wireless link scheduling","author":"kar","year":"2009","journal-title":"IEEE INFOCOM"},{"key":"ref41","article-title":"Taseps: A statistical mechanics tool to analyze the performance of wireless line networks","author":"srinivasa","year":"2009","journal-title":"IEEE\/ACM Trans on Netw"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1080829.1080835","article-title":"Capacity of multi-channel wireless networks: impact of number of channels and interfaces","author":"kyasanur","year":"2005","journal-title":"Mobicom"},{"journal-title":"Paralleler und objektorientierter simplex-algorithmus","year":"1996","author":"wunderling","key":"ref44"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.925942"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1530748.1530761"}],"event":{"name":"IEEE INFOCOM 2011 - IEEE Conference on Computer Communications","start":{"date-parts":[[2011,4,10]]},"location":"Shanghai, China","end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5888673\/5934870\/05934887.pdf?arnumber=5934887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T14:57:48Z","timestamp":1712588268000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5934887\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/infcom.2011.5934887","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}