{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:53Z","timestamp":1759063613893,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1109\/infcom.2010.5462046","type":"proceedings-article","created":{"date-parts":[[2010,5,12]],"date-time":"2010-05-12T20:54:40Z","timestamp":1273697680000},"page":"1-9","source":"Crossref","is-referenced-by-count":13,"title":["Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory"],"prefix":"10.1109","author":[{"given":"Berk","family":"Birand","sequence":"first","affiliation":[]},{"given":"Maria","family":"Chudnovsky","sequence":"additional","affiliation":[]},{"given":"Bernard","family":"Ries","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Seymour","sequence":"additional","affiliation":[]},{"given":"Gil","family":"Zussman","sequence":"additional","affiliation":[]},{"given":"Yori","family":"Zwols","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.169"},{"key":"ref30","article-title":"Bounds on the capacity region of multi-hop wireless networks under distributed greedy scheduling","author":"wu","year":"2006","journal-title":"Proc IEEE INFOCOM'06"},{"journal-title":"Resource Allocation and Cross-Layer Control in Wireless Networks","year":"2006","author":"georgiadis","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.810496"},{"journal-title":"Graph Theory and its Applications","year":"2006","author":"gross","key":"ref12"},{"journal-title":"Simple distributed weighted matchings","year":"2004","author":"hoepman","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.05.021"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-005-1769-9"},{"key":"ref16","article-title":"Performance limits of greedy maximal matching in multi-hop wireless networks","author":"joo","year":"2007","journal-title":"Proc IEEE CDC'07"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.165"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011811"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1530748.1530771"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1145\/1161089.1161094","article-title":"Enabling distributed throughput maximization in wireless mesh networks - a partitioning approach","author":"brzezinski","year":"2006","journal-title":"Proc ACM Mobicom'06"},{"journal-title":"The On-Line Encyclopedia of Integer Sequences","year":"2009","author":"sloane","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1993.1001"},{"journal-title":"Claw-free graphs with strongly perfect complements Fractional and integral version Part I Graphs with ? ? 3 and fuzzy long circular interval graphs","year":"2009","author":"chudnovsky","key":"ref6"},{"journal-title":"Introduction to Graph Theory","year":"2001","author":"west","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913537"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832229"},{"journal-title":"Claw-free graphs with strongly perfect complements Fractional and integral version Part II Graphs with a ? 4 that are not fuzzy long circular interval graphs","year":"2009","author":"chudnovsky","key":"ref7"},{"journal-title":"Analyzing the performance of greedy maximal scheduling via local pooling and graph theory","year":"2009","author":"birand","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1239\/aap\/1151337082"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842562"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1530748.1530758"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(92)90028-V"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.872546"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.23"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/26.780463"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1145\/1161089.1161116","article-title":"On the complexity of scheduling in wireless networks","author":"sharma","year":"2006","journal-title":"Proc ACM Mobicom'06"},{"key":"ref25","first-page":"259","article-title":"Linear time 1\/2-approximation algorithm for maximum weighted matching in general graphs","volume":"1563","author":"preis","year":"1999","journal-title":"LNCS"}],"event":{"name":"IEEE INFOCOM 2010 - IEEE Conference on Computer Communications","start":{"date-parts":[[2010,3,14]]},"location":"San Diego, CA, USA","end":{"date-parts":[[2010,3,19]]}},"container-title":["2010 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5461675\/5461899\/05462046.pdf?arnumber=5462046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T08:07:03Z","timestamp":1497859623000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5462046\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/infcom.2010.5462046","relation":{},"subject":[],"published":{"date-parts":[[2010,3]]}}}