{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T11:57:25Z","timestamp":1773835045787,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540718048","type":"print"},{"value":"9783540718055","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71805-5_3","type":"book-chapter","created":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T17:01:18Z","timestamp":1182358878000},"page":"21-31","source":"Crossref","is-referenced-by-count":20,"title":["Genetic Representations for Evolutionary Minimization of Network Coding Resources"],"prefix":"10.1007","author":[{"given":"Minkyu","family":"Kim","sequence":"first","affiliation":[]},{"given":"Varun","family":"Aggarwal","sequence":"additional","affiliation":[]},{"given":"Una-May","family":"O\u2019Reilly","sequence":"additional","affiliation":[]},{"given":"Muriel","family":"M\u00e9dard","sequence":"additional","affiliation":[]},{"given":"Wonsik","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R. Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.Y.R., Yeung, R.W.: Network information flow. IEEE Trans. Inform. Theory\u00a046(4), 1204\u20131216 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"3_CR2","first-page":"371","volume":"49","author":"S.Y.R. Li","year":"2003","unstructured":"Li, S.Y.R., Yeung, R.W., Cai, N.: Linear network coding. Theory\u00a049(2), 371\u2013381 (2003)","journal-title":"Theory"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1111322.1111337","volume":"36","author":"C. Fragouli","year":"2006","unstructured":"Fragouli, C., Le Boudec, J.Y., Widmer, J.: Network coding: An instant primer. SIGCOMM Comput. Commun. Rev.\u00a036(1), 63\u201368 (2006)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"issue":"4","key":"3_CR4","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1002\/net.3230160408","volume":"16","author":"M.B. Richey","year":"1986","unstructured":"Richey, M.B., Parker, R.G.: On multiple Steiner subgraph problems. Networks\u00a016(4), 423\u2013438 (1986)","journal-title":"Networks"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Langberg, M., Sprintson, A., Bruck, J.: The encoding complexity of network coding. In: Proc. IEEE ISIT (2005)","DOI":"10.1109\/ISIT.2005.1523693"},{"issue":"6","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1973","DOI":"10.1109\/TIT.2005.847712","volume":"51","author":"S. Jaggi","year":"2005","unstructured":"Jaggi, S., Sanders, P., Chou, P.A., Effros, M., Egner, S., Jain, K., Tolhuizen, L.: Polynomial time algorithms for multicast network code construction. IEEE Trans. Inform. Theory\u00a051(6), 1973\u20131982 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Ho, T., Koetter, R., M\u00e9dard, M., Karger, D.R., Effros, M.: The benefits of coding over routing in a randomized setting. In: Proc. IEEE ISIT (2003)","DOI":"10.1109\/ISIT.2003.1228459"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Kim, M., Ahn, C.W., M\u00e9dard, M., Effros, M.: On minimizing network coding resources: An evolutionary approach. In: Proc. NetCod (2006)","DOI":"10.1109\/INFCOM.2007.231"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Kim, M., M\u00e9dard, M., Aggarwal, V., O\u2019Reilly, U.M., Kim, W., Ahn, C.W., Effros, M.: Evolutionary approaches to minimizing network coding resources. In: Proc. IEEE Infocom (to appear) (2007)","DOI":"10.1109\/INFCOM.2007.231"},{"issue":"5","key":"3_CR10","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1109\/TNET.2003.818197","volume":"11","author":"R. Koetter","year":"2003","unstructured":"Koetter, R., M\u00e9dard, M.: An algebraic approach to network coding. Networking\u00a011(5), 782\u2013795 (2003)","journal-title":"Networking"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.ipl.2003.06.002","volume":"90","author":"G. Melan\u00e7on","year":"2004","unstructured":"Melan\u00e7on, G., Philippe, F.: Generating connected acyclic digraphs uniformly at random. Inf. Process. Lett.\u00a090(4), 209\u2013213 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1109\/TIT.2005.864435","volume":"52","author":"C. Fragouli","year":"2006","unstructured":"Fragouli, C., Soljanin, E.: Information flow decomposition for network coding. IEEE Trans. Inform. Theory\u00a052(3), 829\u2013848 (2006)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutinary Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71805-5_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:26:41Z","timestamp":1605763601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71805-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540718048","9783540718055"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71805-5_3","relation":{},"subject":[]}}