{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T19:44:24Z","timestamp":1729626264307,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/netcod.2013.6570816","type":"proceedings-article","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T11:40:54Z","timestamp":1376480454000},"page":"1-6","source":"Crossref","is-referenced-by-count":11,"title":["On Space Information Flow: Single multicast"],"prefix":"10.1109","author":[{"given":"Jiaqing","family":"Huang","sequence":"first","affiliation":[]},{"given":"Xunrui","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Xiaoxi","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xu","family":"Du","sequence":"additional","affiliation":[]},{"given":"Zongpeng","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2011435"},{"year":"0","key":"16"},{"journal-title":"Introduction to Operations Research( 9e)","year":"2009","author":"hillier","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.35"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2012.6261881"},{"journal-title":"Convex Optimization(7e)","year":"2007","author":"boyd","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173720"},{"key":"2","doi-asserted-by":"crossref","first-page":"2467","DOI":"10.1109\/TIT.2006.874515","article-title":"On achieving maximum multicast throughput in undirected networks","volume":"52","author":"li","year":"2006","journal-title":"IEEE Trans on Information Theory"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283071"},{"journal-title":"Exact and Heuristic Algorithms for the Euclidean Steiner Tree Problem","year":"2010","author":"van laarhoven","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283627"},{"journal-title":"Space Information Flow","year":"2011","author":"li","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1137\/0116001"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)E0183-5"}],"event":{"name":"2013 International Symposium on Network Coding (NetCod)","start":{"date-parts":[[2013,6,7]]},"location":"Calgary, AB, Canada","end":{"date-parts":[[2013,6,9]]}},"container-title":["2013 International Symposium on Network Coding (NetCod)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6560497\/6570811\/06570816.pdf?arnumber=6570816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T13:49:48Z","timestamp":1498052988000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6570816\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/netcod.2013.6570816","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}