{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T12:58:32Z","timestamp":1725713912908},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/netcod.2015.7176783","type":"proceedings-article","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T22:50:40Z","timestamp":1439419840000},"page":"26-30","source":"Crossref","is-referenced-by-count":6,"title":["A graph model for opportunistic network coding"],"prefix":"10.1109","author":[{"given":"Sameh","family":"Sorour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neda","family":"Aboutoraby","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tareq Y.","family":"Al-Naffouri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed-Slim","family":"Alouini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570817"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SECON.2012.6275780"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2015.7176783"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2009.5437470"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090612"},{"journal-title":"Complexity and Approximation Combinatorial Optimization Problems and Their Approximability Properties","year":"1999","author":"ausiello","key":"ref15"},{"key":"ref16","article-title":"A new exact algorithm for the maximum weight clique problem","author":"yamaguchi","year":"2008","journal-title":"23rd International Conference on Circuits\/Systems Computers and Communictions (ITC-CSCC'08)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707070"},{"key":"ref3","article-title":"Multiuser broadcast erasure channel with feedback capacity and algorithms","author":"gatzianas","year":"2010","journal-title":"4th Workshop on Network Control and Optimization (NetCoop'10)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2010.5683677"},{"key":"ref5","article-title":"Completion delay minimization for instantly decodable network codes","author":"sorour","year":"2014","journal-title":"accepted for publication in IEEE\/ACM Transactions on Networking"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2011.092011.101652"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110519"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205612"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2008.4476183"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283957"}],"event":{"name":"2015 International Symposium on Network Coding (NetCod)","start":{"date-parts":[[2015,6,22]]},"location":"Sydney, Australia","end":{"date-parts":[[2015,6,24]]}},"container-title":["2015 International Symposium on Network Coding (NetCod)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7172790\/7176630\/07176783.pdf?arnumber=7176783","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T20:44:33Z","timestamp":1490388273000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7176783\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/netcod.2015.7176783","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}