{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T15:43:40Z","timestamp":1781797420344,"version":"3.54.5"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1109\/tnet.2011.2157831","type":"journal-article","created":{"date-parts":[[2011,8,3]],"date-time":"2011-08-03T21:31:53Z","timestamp":1312407113000},"page":"163-176","source":"Crossref","is-referenced-by-count":21,"title":["Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory"],"prefix":"10.1109","volume":"20","author":[{"given":"Berk","family":"Birand","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maria","family":"Chudnovsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernard","family":"Ries","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Seymour","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gil","family":"Zussman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yori","family":"Zwols","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.810496"},{"key":"ref11","author":"gross","year":"2006","journal-title":"Graph Theory and its Applications"},{"key":"ref12","author":"hoepman","year":"2004","journal-title":"Simple distributed weighted matchings"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.05.021"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-005-1769-9"},{"key":"ref15","first-page":"1128","article-title":"Performance limits of greedy maximal matching in multi-hop wireless networks","author":"joo","year":"2007","journal-title":"Proc IEEE CDC"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.165"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1530748.1530771"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1530748.1530758"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.872546"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.169"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.918109"},{"key":"ref27","author":"west","year":"2001","journal-title":"Introduction to Graph Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1993.1001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.06.024"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913537"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832229"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.06.024"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462046"},{"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.1016\/0095-8956(92)90028-V"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.23"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/26.780463"},{"key":"ref24","first-page":"227","article-title":"On the complexity of scheduling in wireless networks","author":"sharma","year":"2006","journal-title":"Proc ACM MobiCom"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49116-3_24"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"ref25","author":"sloane","year":"2009","journal-title":"The On-Line Encyclopedia of Integer Sequences"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/90\/6151256\/05967921.pdf?arnumber=5967921","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:52:53Z","timestamp":1642006373000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5967921\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":28,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2011.2157831","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2]]}}}