{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T11:40:16Z","timestamp":1740915616664,"version":"3.38.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1109\/allerton.2010.5706951","type":"proceedings-article","created":{"date-parts":[[2011,2,3]],"date-time":"2011-02-03T21:50:52Z","timestamp":1296769852000},"page":"522-529","source":"Crossref","is-referenced-by-count":2,"title":["Approximation algorithms for link scheduling with physical interference model in wireless multi-hop networks"],"prefix":"10.1109","author":[{"given":"Shuai","family":"Fan","sequence":"first","affiliation":[]},{"given":"Lin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Ren","sequence":"additional","affiliation":[]},{"given":"Bhaskar","family":"Krishnamachari","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/90.222924"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/1161089.1161116","article-title":"On the complexity of scheduling in wireless networks","author":"sharma","year":"2006","journal-title":"MOBICOM 2006 Proceedings of the 12th annual international conference on Mobile computing and networking"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-005-1769-9"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/VETECS.2004.1390655"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1161089.1161092","article-title":"Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks","author":"brar","year":"2006","journal-title":"MOBICOM 2006 Proceedings of the 12th annual international conference on Mobile computing and networking"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2006.883734"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1288107.1288123"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.23"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1132905.1132939"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.172"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1374618.1374632"},{"key":"ref4","article-title":"Protocol Design Beyond Graph-Based Models","author":"moscibroda","year":"2006","journal-title":"ACM HotNets"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.11"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/501449.501453"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1288107.1288122"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579324"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/VTCF.2006.245"},{"key":"ref8","first-page":"1021","article-title":"End-to-end packet-scheduling in wireless ad-hoc networks","author":"kumar","year":"2004","journal-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.21215"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2003.1258872"},{"key":"ref9","first-page":"39","article-title":"Coloring unstructured radio networks","author":"moscibroda","year":"2005","journal-title":"Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.169"},{"key":"ref22","article-title":"The impact of imperfect scheduling on cross-layer rate control in wireless networks","volume":"3","author":"lin","year":"2005","journal-title":"Proceedings IEEE INFOCOM 2005 24th Annual Joint Conference of the IEEE Computer and Communications Societies"},{"key":"ref21","article-title":"Throughput guarantees through maximal scheduling in wireless networks","author":"chaporkar","year":"2005","journal-title":"43rd Annual Allerton Conf on Communications Control and Computing"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.42"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1140277.1140283"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/WIMESH.2006.288618"},{"key":"ref25","article-title":"MAC Scheduling with Low Overheads by Learning Neighborhood Contention Patterns","author":"yi","year":"2007","journal-title":"Tech Rep"}],"event":{"name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2010,9,29]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2010,10,1]]}},"container-title":["2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5701578\/5706874\/05706951.pdf?arnumber=5706951","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T10:36:05Z","timestamp":1740911765000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5706951\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/allerton.2010.5706951","relation":{},"subject":[],"published":{"date-parts":[[2010,9]]}}}