{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:00:01Z","timestamp":1730278801210,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/itw.2006.1633835","type":"proceedings-article","created":{"date-parts":[[2006,5,25]],"date-time":"2006-05-25T20:26:01Z","timestamp":1148588761000},"page":"307-311","source":"Crossref","is-referenced-by-count":3,"title":["Network Coding in Minimal Multicast Networks"],"prefix":"10.1109","author":[{"given":"S.Y.","family":"el Rouayheb","sequence":"first","affiliation":[]},{"given":"C.N.","family":"Georghiades","sequence":"additional","affiliation":[]},{"given":"A.","family":"Sprintson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"0","key":"15"},{"key":"13","article-title":"Packing steiner trees","author":"jain","year":"2003","journal-title":"Proc 11th ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"14","article-title":"A comparison of network coding and tree packing","author":"wu","year":"2004","journal-title":"Proc of IEEE International Symposium on Information Theory(ISIT)"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523693"},{"key":"3","article-title":"Handbook of combinatorics","volume":"1","author":"graham","year":"1995","journal-title":"The MIT Press"},{"key":"2","article-title":"Algorithmic graph theory and perfect graphs: Second edition","author":"golumbic","year":"2004","journal-title":"Elsevier B V"},{"journal-title":"Graph Theory","year":"1997","author":"diestel","key":"1"},{"key":"10","article-title":"Complexity classification of network information flow problems","author":"rasala-lehman","year":"2003","journal-title":"41st Annual Atterton Conference on Communication Control and Computing"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"4","article-title":"Introduction to algorithms","author":"cormen","year":"2001","journal-title":"The MIT Press"},{"key":"9","article-title":"Network coding as a coloring problem","author":"fragouli","year":"2004","journal-title":"Proceeding of CISS"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"}],"event":{"name":"2006 IEEE Information Theory Workshop","location":"Punta del Este, Uruguay"},"container-title":["2006 IEEE Information Theory Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10885\/34255\/01633835.pdf?arnumber=1633835","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T04:30:03Z","timestamp":1489552203000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1633835\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/itw.2006.1633835","relation":{},"subject":[]}}