{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:12:32Z","timestamp":1758269552516},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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,1]]},"DOI":"10.1109\/tit.2010.2090196","type":"journal-article","created":{"date-parts":[[2010,12,29]],"date-time":"2010-12-29T22:05:04Z","timestamp":1293660304000},"page":"461-475","source":"Crossref","is-referenced-by-count":14,"title":["Minimum Cost Distributed Source Coding Over a Network"],"prefix":"10.1109","volume":"57","author":[{"given":"Aditya","family":"Ramamoorthy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.830888"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(80)90284-3"},{"key":"ref32","article-title":"Minimum-cost subgraphs for joint distributed source and network coding","author":"lee","year":"2007","journal-title":"Proc 2nd Workshop on Network Coding Theory and Applications (NetCod)"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.032012.100791"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2005.1494450"},{"key":"ref37","author":"van lint","year":"1993","journal-title":"A Course in Combinatorics"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056524"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/18.737513"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"189","DOI":"10.15807\/jorsj.21.189","article-title":"algorithms for solving the independent-flow problems","volume":"21","author":"fujishige","year":"1978","journal-title":"J Operat Res Soc Jpn"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062277"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2006.346396"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062277"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/332833.332838"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874536"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557533"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595403"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1023\/A:1007682909695","article-title":"collecting correlated data through a network with minimum cost: distance entropy and a practical order optimal design","author":"liu","year":"0","journal-title":"IEEE Trans Inf Theory"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.1109\/ICCCN.2006.286323","article-title":"on optimal communication cost for gathering correlated data through wireless sensor networks","author":"liu","year":"2006","journal-title":"Proc 5th Annu ACM Int Conf Mobile Comput Netw (MobiCom)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523281"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860435"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874531"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(96)00019-3"},{"key":"ref11","first-page":"102","article-title":"Network information flow—Multiple sources","author":"song","year":"2001","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874534"},{"key":"ref14","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874523"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.623151"},{"key":"ref17","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref18","author":"li","year":"2010","journal-title":"Network Distributed Source Catalog"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858980"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871046"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.808103"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2004.1328091"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917687"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820015"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s101070050090"},{"key":"ref45","first-page":"119","article-title":"rate region of the quadratic gaussian ceo problem","author":"prabhakaran","year":"2004","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/BF02191984","article-title":"approximations in proximal bundle methods and decomposition of convex programs","volume":"84","author":"kiwiel","year":"1995","journal-title":"J Optim Theory Appl"},{"key":"ref47","article-title":"energy conserving routing in wireless ad-hoc networks","author":"chang","year":"2000","journal-title":"IEEE INFOCOM"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354677"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850110"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/18.490552"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5673678\/05673808.pdf?arnumber=5673808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T17:06:45Z","timestamp":1685898405000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5673808\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1]]},"references-count":49,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2090196","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1]]}}}