{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:52Z","timestamp":1740131692660,"version":"3.37.3"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100004853","name":"Vice-Chancellor\u2019s One-off Discretionary Fund of The Chinese University of Hong Kong","doi-asserted-by":"publisher","award":["VCF2014030","VCF2015007"],"award-info":[{"award-number":["VCF2014030","VCF2015007"]}],"id":[{"id":"10.13039\/501100004853","id-type":"DOI","asserted-by":"publisher"}]},{"name":"University Grants Committee of the Hong Kong Special Administrative Region, China","award":["14200714"],"award-info":[{"award-number":["14200714"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1109\/tit.2017.2761390","type":"journal-article","created":{"date-parts":[[2017,10,9]],"date-time":"2017-10-09T18:11:42Z","timestamp":1507572702000},"page":"1919-1944","source":"Crossref","is-referenced-by-count":10,"title":["Determining Optimal Rates for Communication for Omniscience"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9825-7338","authenticated-orcid":false,"given":"Ni","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2006-0898","authenticated-orcid":false,"given":"Chung","family":"Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9779-7225","authenticated-orcid":false,"given":"Qiaoqiao","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodney A.","family":"Kennedy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9965-9483","authenticated-orcid":false,"given":"Parastoo","family":"Sadeghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Geometric Algorithms and Combinatorial Optimization","year":"2012","author":"gr\u00f6tschel","key":"ref39"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(80)90061-0"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(91)90070-D"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-44-01150-6"},{"journal-title":"Submodular Functions and Electrical Networks","year":"1997","author":"narayanan","key":"ref31"},{"journal-title":"Information Theory and Network Coding","year":"2008","author":"yeung","key":"ref30"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90013-2"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9177-z"},{"key":"ref35","first-page":"1","article-title":"Partition inequalities: Separation, extensions and network design","author":"ba\u00efou","year":"2011","journal-title":"Prog Combinat Optim"},{"journal-title":"Combinatorial Optimization Polyhedra and Efficiency","year":"2003","author":"schrijver","key":"ref34"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1561\/0100000072"},{"journal-title":"On tightness of mutual dependence upper bound for secret-key capacity of multiple terminals","year":"2008","author":"chan","key":"ref27"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-68874-4_10"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282930"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848809"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2015.7176782"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICT.2015.7124654"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483260"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(78)91063-X"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2015.7176786"},{"journal-title":"Submodular Functions and Optimization","year":"2005","author":"fujishige","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36478-1_2"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/080736156"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s13160-012-0083-z"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(80)90057-8"},{"key":"ref58","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"},{"journal-title":"Structured convex optimization under submodular constraints","year":"2013","author":"nagano","key":"ref57"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592217"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1287\/moor.5.2.186"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541712"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1030.0076"},{"journal-title":"Resource Allocation Problems Algorithmic Approaches","year":"1988","author":"ibaraki","key":"ref52"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2010.5680380"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513313"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579273"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2011.5743607"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICCChina.2012.6356856"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120324"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2290993"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5979066"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2523980"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2458316"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/AusCTW.2016.7433656"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089530"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081450"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503135"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555923"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.3.367"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707096"},{"key":"ref46","first-page":"1759","article-title":"Minimum average cost clustering","author":"nagano","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034157"},{"journal-title":"Info-clustering A mathematical theory for data clustering","year":"2016","author":"chan","key":"ref48"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3829"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502096"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0084-2"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0189-2"},{"key":"ref43","first-page":"3","article-title":"A submodular function minimization algorithm based on the minimum-norm base","volume":"7","author":"fujishige","year":"2011","journal-title":"Pacific J Optim"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8293743\/08063422.pdf?arnumber=8063422","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:26:41Z","timestamp":1642004801000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8063422\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":59,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2761390","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}