{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:26:04Z","timestamp":1761708364491,"version":"3.37.0"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1109\/infcom.2009.5061950","type":"proceedings-article","created":{"date-parts":[[2009,6,3]],"date-time":"2009-06-03T15:10:14Z","timestamp":1244041814000},"page":"450-458","source":"Crossref","is-referenced-by-count":25,"title":["An Evolutionary Approach To Inter-Session Network Coding"],"prefix":"10.1109","author":[{"given":"M.","family":"Kim","sequence":"first","affiliation":[{"name":"Lab. of Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Medard","sequence":"additional","affiliation":[{"name":"Lab. of Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.-M.","family":"O'Reilly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Traskov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.231"},{"article-title":"network coding with a cost criterion","year":"2004","author":"lun","key":"17"},{"key":"18","article-title":"on minimizing network coding resources: an evolutionary approach","author":"kim","year":"2006","journal-title":"Proc NetCod"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557214"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.25"},{"key":"13","article-title":"on constructive network coding for multiple unicasts","author":"ho","year":"2006","journal-title":"Proc Allerton Conference on Communication Control and Computing"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095110"},{"key":"11","article-title":"the importance of being opportunistic: practical network coding for wireless environments","author":"katti","year":"2005","journal-title":"Proc Allerton Conference"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261656"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277201"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71805-5_3"},{"key":"22","article-title":"on the codinglink cost tradeoff in multicast network coding","author":"kim","year":"2007","journal-title":"Proc MILCOM"},{"key":"23","article-title":"network coding: the case of multiple unicast sessions","author":"li","year":"2004","journal-title":"Proc Annual Allerton Conference on Communication Control and Computing"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"journal-title":"Report on DIMACS working group on data de-identification combinatorial optimization graph theory and the stat\/OR interface","year":"2005","author":"milanicmilanic?","key":"25"},{"key":"26","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","author":"mitchell","year":"1996","journal-title":"An Introduction to Genetic Algorithms"},{"article-title":"evolutionary approaches toward practical network coding","year":"2008","author":"kim","key":"27"},{"key":"28","article-title":"practical network coding","author":"chou","year":"2003","journal-title":"Proc Annual Allerton Conference on Communication Control and Computing"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1561\/0100000007II"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920209"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851744"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557213"},{"key":"5","article-title":"dualities between entropy functions and network codes","author":"chan","year":"2007","journal-title":"submitted to IEEE Trans Inform Theory (arXiv 0708 4328v1)"},{"key":"4","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":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"8","article-title":"a systematic approach to network coding problems using conflict graphs","author":"sundararajan","year":"2006","journal-title":"Proc Information Theory and its Applications"}],"event":{"name":"2009 Proceedings IEEE INFOCOM","start":{"date-parts":[[2009,4,19]]},"location":"Rio de Janeiro, Brazil","end":{"date-parts":[[2009,4,25]]}},"container-title":["IEEE INFOCOM 2009"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5061887\/5061888\/05061950.pdf?arnumber=5061950","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T22:22:36Z","timestamp":1739139756000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5061950\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/infcom.2009.5061950","relation":{},"subject":[],"published":{"date-parts":[[2009,4]]}}}