{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:55:06Z","timestamp":1740131706238,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T00:00:00Z","timestamp":1459468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T00:00:00Z","timestamp":1459468800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T00:00:00Z","timestamp":1459468800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T00:00:00Z","timestamp":1459468800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000774","name":"Defense Threat Reduction Agency","doi-asserted-by":"publisher","award":["HDTRA1-09-1-0032"],"award-info":[{"award-number":["HDTRA1-09-1-0032"]}],"id":[{"id":"10.13039\/100000774","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0964018","CCF-0830788"],"award-info":[{"award-number":["CCF-0964018","CCF-0830788"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-09-1-0120","FA9550-10-1-0567"],"award-info":[{"award-number":["FA9550-09-1-0120","FA9550-10-1-0567"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1109\/tit.2016.2523980","type":"journal-article","created":{"date-parts":[[2016,2,3]],"date-time":"2016-02-03T19:12:50Z","timestamp":1454526770000},"page":"1878-1896","source":"Crossref","is-referenced-by-count":21,"title":["Efficient Algorithms for the Data Exchange Problem"],"prefix":"10.1109","volume":"62","author":[{"given":"Nebojsa","family":"Milosavljevic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sameer","family":"Pawar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salim","family":"El Rouayheb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Gastpar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Resource Allocation Problems Algorithmic Approaches","year":"1988","author":"ibaraki","key":"ref33"},{"key":"ref32","article-title":"Subgradient methods","author":"boyd","year":"2004","journal-title":"Lecture notes of EE392o"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0189-2"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"journal-title":"Network Optimization Continuous and Discrete Models","year":"1998","author":"bertsekas","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2290993"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5979066"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"article-title":"Generating secret in a network","year":"2010","author":"chan","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089530"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120294"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749293"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633031"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462030"},{"key":"ref28","first-page":"1759","article-title":"Minimum average cost clustering","author":"nagano","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503135"},{"journal-title":"Submodular Functions and Optimization","year":"2005","author":"fujishige","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483260"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2011.5743607"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589419"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513313"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707096"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2010.5680380"},{"article-title":"Optimal deterministic polynomial-time data exchange for omniscience","year":"2011","author":"milosavljevic","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120324"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034157"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2457443"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874523"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2009.5291585"},{"key":"ref26","first-page":"69","article-title":"Submodular functions, matroids, and certain polyhedra","author":"edmonds","year":"1970","journal-title":"Proceedings Calgary International Conference on Combinatorial Structures and Their Applications"},{"key":"ref25","first-page":"489","article-title":"Deterministic network coding by matrix completion","author":"harvey","year":"2005","journal-title":"Proc 16th Annu ACM-SIAM Symp Discrete Algorithms"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/18\/7434091\/7398036-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7434091\/07398036.pdf?arnumber=7398036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:52:12Z","timestamp":1649443932000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7398036\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":36,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2523980","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2016,4]]}}}