{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:36:15Z","timestamp":1725798975352},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1109\/allerton.2012.6483260","type":"proceedings-article","created":{"date-parts":[[2013,3,27]],"date-time":"2013-03-27T20:58:45Z","timestamp":1364417925000},"page":"502-508","source":"Crossref","is-referenced-by-count":9,"title":["Efficient algorithms for the data exchange problem under fairness constraints"],"prefix":"10.1109","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":"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":[{"key":"17","first-page":"69","article-title":"Submodular functions, matroids, and certain polyhedra","author":"edmonds","year":"1970","journal-title":"Combinatorial Structures and Their Applications"},{"journal-title":"Resource Allocation Problems Algorithmic Approaches","year":"1988","author":"ibaraki","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0189-2"},{"key":"13","article-title":"Deterministic polynomial-time algorithm for the data exchange problems","author":"milosavljevic","year":"2012","journal-title":"submitted to JSAC"},{"journal-title":"Submodular Functions and Optimization","year":"2005","author":"fujishige","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"12","first-page":"489","article-title":"Deterministic network coding by matrix completion","author":"harvey","year":"2005","journal-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2011.5743607"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513313"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503135"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181950"},{"journal-title":"Optimal Deterministic Polynomial-time Data Exchange for Omniscience","year":"2011","author":"milosavljevic","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034157"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120324"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5979066"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283990"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2010.5680380"}],"event":{"name":"2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2012,10,1]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2012,10,5]]}},"container-title":["2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6475439\/6483185\/06483260.pdf?arnumber=6483260","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T23:26:56Z","timestamp":1490225216000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6483260\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/allerton.2012.6483260","relation":{},"subject":[],"published":{"date-parts":[[2012,10]]}}}