{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T20:07:51Z","timestamp":1730232471693,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1109\/icc.2007.595","type":"proceedings-article","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T15:36:11Z","timestamp":1187796971000},"page":"3610-3615","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Distributed Multicast Routing using Network Coding"],"prefix":"10.1109","author":[{"given":"Y.","family":"Cui","sequence":"first","affiliation":[]},{"given":"Y.","family":"Xue","sequence":"additional","affiliation":[]},{"given":"K.","family":"Nahrstedt","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Communication Nets Stochastic Message Flow and Delay","year":"1964","author":"kleinrock","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/26.48893"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"14","article-title":"Practical network coding","author":"chou","year":"2003","journal-title":"Allerton Conference on Communication Control and Computing"},{"key":"11","article-title":"Network coding with a cost criterion","author":"lun","year":"2004","journal-title":"International Symposium on Information Theory and its Applications (ISITA)"},{"journal-title":"Optimal distributed multicast routing using network coding Theory and applications","year":"2004","author":"cui","key":"12"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096159"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093711"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498443"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"6","article-title":"Packing steiner trees","author":"jain","year":"2003","journal-title":"Proc ACM-SIAM Symp on Discrete Algorithms"},{"key":"5","article-title":"Improved steiner tree approximation in graphs","author":"robins","year":"2000","journal-title":"Proc 8th ACM-SIAM Symp Discrete Algorithms"},{"key":"4","article-title":"On the approximability of the steiner tree problem","volume":"2136","author":"thimm","year":"2001","journal-title":"Springer LNCS"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/339331.339337"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"}],"event":{"name":"2007 IEEE International Conference on Communications","start":{"date-parts":[[2007,6,24]]},"location":"Glasgow, Scotland","end":{"date-parts":[[2007,6,28]]}},"container-title":["2007 IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4288670\/4288671\/04289266.pdf?arnumber=4289266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T13:23:50Z","timestamp":1489670630000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4289266\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icc.2007.595","relation":{},"subject":[],"published":{"date-parts":[[2007,6]]}}}