{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:24Z","timestamp":1761611304357,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1109\/infcom.2012.6195772","type":"proceedings-article","created":{"date-parts":[[2012,5,24]],"date-time":"2012-05-24T18:26:40Z","timestamp":1337884000000},"page":"352-360","source":"Crossref","is-referenced-by-count":20,"title":["Optimal routing and scheduling for a simple network coding scheme"],"prefix":"10.1109","author":[{"given":"Nathaniel M.","family":"Jones","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brooke","family":"Shrader","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eytan","family":"Modiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261656"},{"key":"15","article-title":"On the complexity of scheduling in wireless networks","author":"sharma","year":"0","journal-title":"Proc MOBICOM 2006"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.124"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2011.5930037"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/1375457.1375468"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.4108\/ICST.WICON2008.4967"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.81"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1287853.1287870"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"10","article-title":"Optimal scheduling of pairwise XORs under statistical overhearing and feedback","author":"paschos","year":"0","journal-title":"Proc IEEE RAWNET 2011"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090604"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923722"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1561\/1300000001"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095110"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.837349"},{"key":"8","first-page":"194","article-title":"A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph","volume":"44","author":"nakamura","year":"2001","journal-title":"J Oper Res Soc Japan"}],"event":{"name":"IEEE INFOCOM 2012 - IEEE Conference on Computer Communications","start":{"date-parts":[[2012,3,25]]},"location":"Orlando, FL, USA","end":{"date-parts":[[2012,3,30]]}},"container-title":["2012 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6189419\/6195452\/06195772.pdf?arnumber=6195772","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T12:12:57Z","timestamp":1490098377000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6195772\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/infcom.2012.6195772","relation":{},"subject":[],"published":{"date-parts":[[2012,3]]}}}