{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T22:39:00Z","timestamp":1790980740548,"version":"4.1.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1109\/ciss.2011.5766116","type":"proceedings-article","created":{"date-parts":[[2011,5,13]],"date-time":"2011-05-13T18:17:38Z","timestamp":1305310658000},"page":"1-6","source":"Crossref","is-referenced-by-count":3,"title":["Bridging tree-packing and network coding: An information flow approach"],"prefix":"10.1109","author":[{"given":"Daniel E.","family":"Lucani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muriel","family":"Meedard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","article-title":"A Comparison of Network Coding and Tree Packing","author":"wu","year":"2004","journal-title":"Proc of ISIT'04"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"2398","DOI":"10.1109\/TIT.2006.874430","article-title":"A Unification of Network Coding and Tree-Packing (Routing) Theorems","volume":"52","author":"wu","year":"2006","journal-title":"IEEE Trans on Info Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864435"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2007.4454941"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2010.5502556"},{"key":"ref15","article-title":"On Achieving Optimal Throughput with Network Coding","author":"li","year":"2005","journal-title":"Proc INFOCOM'05"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref6","article-title":"Network Coding in Undirected Networks","author":"li","year":"2004","journal-title":"Proc of the 38th Annual Conference on Information Sciences and Systems (CISS 2004)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874523"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523641"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874433"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref9","article-title":"Network Coding Capacity with a Constrained Number of Coding Nodes","author":"cannons","year":"2006","journal-title":"Proc Allerton Conference on Communication Control and Computing"}],"event":{"name":"2011 45th Annual Conference on Information Sciences and Systems (CISS)","location":"Baltimore, MD, USA","start":{"date-parts":[[2011,3,23]]},"end":{"date-parts":[[2011,3,25]]}},"container-title":["2011 45th Annual Conference on Information Sciences and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5764460\/5766094\/05766116.pdf?arnumber=5766116","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T00:11:05Z","timestamp":1497917465000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5766116\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/ciss.2011.5766116","relation":{},"subject":[],"published":{"date-parts":[[2011,3]]}}}