{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T23:46:29Z","timestamp":1705967189768},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T00:00:00Z","timestamp":1375315200000},"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":[[2013,8]]},"DOI":"10.1109\/tit.2013.2253543","type":"journal-article","created":{"date-parts":[[2013,3,20]],"date-time":"2013-03-20T18:07:39Z","timestamp":1363802859000},"page":"5075-5087","source":"Crossref","is-referenced-by-count":4,"title":["An Asymptotically Optimal Push\u2013Pull Method for Multicasting Over a Random Network"],"prefix":"10.1109","volume":"59","author":[{"given":"Vasuki Narasimha","family":"Swamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srikrishna","family":"Bhashyam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajesh","family":"Sundaresan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pramod","family":"Viswanath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"61","article-title":"An approximate max-Steiner-tree-packing min-Steiner-cut theorem","author":"lau","year":"2004","journal-title":"Proc 45th IEEE Symp Found Comput Sci"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-008-9150-4"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/moor.18.1.71"},{"key":"ref13","article-title":"Mutualcast: An efficient mechanism for one-to-many content distribution","author":"li","year":"2005","journal-title":"presented at the ACM SIGCOMM ASIA Workshop"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"2467","DOI":"10.1109\/TIT.2006.874515","article-title":"On achieving optimal multicast throughput in undirected networks","volume":"52","author":"li","year":"2006","journal-title":"IEEE Trans Inf Theory"},{"key":"ref15","first-page":"129","article-title":"On the edge arboricity of a random graph","volume":"35 a","author":"catlin","year":"1995","journal-title":"Ars Combin"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2009.04.008"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1239\/jap\/1269610826"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1080\/17442508208833234"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","article-title":"On the problem of decomposing a graph into <formula formulatype=\"inline\"><tex Notation=\"TeX\">$n$<\/tex><\/formula> connected factors","volume":"36","author":"tutte","year":"1961","journal-title":"J Lond Math Soc"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498493"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/moor.20.1.104"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-36.1.445"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02614374"},{"key":"ref7","article-title":"Packing Steiner trees","author":"jain","year":"2003","journal-title":"Proc 19th Annu ACM-SIAM Symp Discr Algor"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173720"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2011435"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/90.851977"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851725"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874531"},{"key":"ref21","article-title":"Network coding: The case of multiple unicast sessions","author":"li","year":"2004","journal-title":"Proc 42nd Annu Allerton Conf Commun Control Comput"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874543"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6557006\/06482634.pdf?arnumber=6482634","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:46Z","timestamp":1638218866000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6482634\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":23,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2253543","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8]]}}}