{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T12:30:46Z","timestamp":1791203446469,"version":"4.2.0"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2009,3,1]],"date-time":"2009-03-01T00:00:00Z","timestamp":1235865600000},"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 Trans. Inform. Theory"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1109\/tit.2008.2011516","type":"journal-article","created":{"date-parts":[[2009,2,26]],"date-time":"2009-02-26T18:05:02Z","timestamp":1235671502000},"page":"1016-1026","source":"Crossref","is-referenced-by-count":75,"title":["A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks"],"prefix":"10.1109","volume":"55","author":[{"given":"Zongpeng","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Baochun","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lap Chi","family":"Lau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/313451.313558"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/S0036142993226983"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-007-0044-3"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883634"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792225297"},{"key":"ref30","author":"frank","year":"2000","journal-title":"Edge-Connection of Graphs Digraphs and Hypergraphs"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523639"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261718"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2006.879847"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.12"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-36.1.221"},{"key":"ref27","author":"west","year":"2001","journal-title":"Introduction to Graph Theory"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-36.1.445"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref20","article-title":"on achieving optimal throughput with network coding","author":"li","year":"2005","journal-title":"Proc IEEE InfoCom"},{"key":"ref22","article-title":"network coding: the case of multiple unicast sessions","author":"li","year":"2004","journal-title":"42nd Annual Allerton Conference on Communication Control and Computing"},{"key":"ref21","author":"harvey","year":"2004","journal-title":"Comparing Network Coding with Multicommodity Flow for the k-pairs Communication Problem"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8608-5","author":"yeung","year":"2002","journal-title":"A First Course in Information Theory"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10922-005-9019-0"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3829"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874515"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44683-4_59"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523506"},{"key":"ref11","author":"liu","year":"2006","journal-title":"Bounds on the Gain of Network Coding and Broadcasting in Wireless Networks"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2001.940390"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228458"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792236237"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"ref17","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523282"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874405"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405308"},{"key":"ref3","article-title":"a comparison of network coding and tree packing","author":"wu","year":"2004","journal-title":"Proc ISIT"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874531"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874433"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874543"},{"key":"ref7","article-title":"tighter cut-based bounds for k-pairs communication problems","author":"harvey","year":"2005","journal-title":"Proc 43rd Annu Allerton Conf Commun Contr Comput"},{"key":"ref49","article-title":"a high throughput overlay multicast infrastructure with network coding","author":"wang","year":"2005","journal-title":"Proc IEEE Int Workshop on Quality of Service (IWQoS)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.837362(410) 23"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874523"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1035334.1035353"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.881617"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90009-2"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633031"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2011516"},{"key":"ref43","article-title":"packing steiner trees","author":"jain","year":"2003","journal-title":"Proc 10th Annu ACM-SIAM Symp Discr Algor (SODA)"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/4787592\/04787632.pdf?arnumber=4787632","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:59:31Z","timestamp":1633910371000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4787632\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":50,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2008.2011516","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2009,3]]}}}