{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:24:59Z","timestamp":1775053499475,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/netcod.2013.6570820","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":2,"title":["Multicast packing for coding across multiple unicasts"],"prefix":"10.1109","author":[{"given":"Chun","family":"Meng","sequence":"first","affiliation":[]},{"given":"Hulya","family":"Seferoglu","sequence":"additional","affiliation":[]},{"given":"Athina","family":"Markopoulou","sequence":"additional","affiliation":[]},{"given":"Kenneth W.","family":"Shum","sequence":"additional","affiliation":[]},{"given":"Chung","family":"Chan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","author":"meng","year":"0","journal-title":"Packing Multicasts for Multiple-unicast Scenarios"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/90.851977"},{"key":"18","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"kirkpatrick","year":"1983","journal-title":"Science"},{"key":"15","first-page":"1033","article-title":"Network coding for three unicast sessions: Interference alignment approaches","author":"ramakrishnan","year":"2011","journal-title":"Allerton Conference"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283630"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2012.6362895"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513311"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2008.080927"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923722"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.25"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261656"},{"key":"6","first-page":"142","article-title":"Complexity classification of network information flow problems","author":"lehman","year":"2004","journal-title":"Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851744"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050932"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061950"}],"event":{"name":"2013 International Symposium on Network Coding (NetCod)","location":"Calgary, AB, Canada","start":{"date-parts":[[2013,6,7]]},"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\/06570820.pdf?arnumber=6570820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T13:49:49Z","timestamp":1498052989000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6570820\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/netcod.2013.6570820","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}