{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:50:18Z","timestamp":1774680618007,"version":"3.50.1"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T00:00:00Z","timestamp":1296518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1109\/tit.2010.2094910","type":"journal-article","created":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T20:15:42Z","timestamp":1295640942000},"page":"1008-1014","source":"Crossref","is-referenced-by-count":56,"title":["On the Hardness of Approximating the Network Coding Capacity"],"prefix":"10.1109","volume":"57","author":[{"given":"Michael","family":"Langberg","sequence":"first","affiliation":[]},{"given":"Alex","family":"Sprintson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF01261326"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.42"},{"key":"ref32","article-title":"network coding: the case for multiple unicast sessions","author":"li","year":"2004","journal-title":"Proc 42nd Ann Allerton Conf Commun Contr Comput"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132567"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056027"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.41"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048502"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.48"},{"key":"ref10","author":"rasala","year":"2005","journal-title":"Network Coding"},{"key":"ref11","article-title":"complexity classification of network information flow problems","author":"rasala","year":"2004","journal-title":"Proc 17th Ann ACM-SIAM Symp Discrete Algorithm (SODA '06)"},{"key":"ref12","article-title":"On coding for nonmulticast networks","author":"mdard","year":"2003","journal-title":"Proc 41st Ann Allerton Conf Commun Contr Comput"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896862"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109585"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874531"},{"key":"ref16","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":"ref17","author":"yeung","year":"2006","journal-title":"Foundations and Trends in Communications and Information Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928963"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594999"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2000.856749"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070013"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref6","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref29","article-title":"on the power of unique 2-prover 1-round games","author":"khot","year":"2002","journal-title":"Proc 30th Ann ACM Symp Theory of Computers (STOC)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851744"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1561\/0100000007","author":"yeung","year":"2006","journal-title":"Network Coding Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref9","article-title":"Practical network coding","author":"chou","year":"2003","journal-title":"Proc Allerton Conf Commun Contr Comput"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394818"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132612"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90246-6"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(96)00190-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/274787.274791"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132548"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(02)00217-1"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5695090\/05695129.pdf?arnumber=5695129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:34Z","timestamp":1633909654000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5695129\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":38,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2094910","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2]]}}}