{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T07:59:53Z","timestamp":1729670393583,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/allerton.2014.7028597","type":"proceedings-article","created":{"date-parts":[[2015,2,5]],"date-time":"2015-02-05T19:24:07Z","timestamp":1423164247000},"page":"1238-1245","source":"Crossref","is-referenced-by-count":1,"title":["Fast near-optimal subnetwork selection in layered relay networks"],"prefix":"10.1109","author":[{"given":"Ritesh","family":"Kolte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayfer","family":"Ozgur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"kirkpatrick","year":"1983","journal-title":"Science"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7744-1_2"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2119930"},{"key":"2","doi-asserted-by":"crossref","first-page":"1872","DOI":"10.1109\/TIT.2011.2110110","article-title":"Wireless network information flow: A deterministic approach","volume":"57","author":"avestimehr","year":"2011","journal-title":"IEEE Trans Inf Theory"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1561\/1300000004"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875169"},{"key":"7","first-page":"381","article-title":"Optimizing quantizemap-and-forward relaying for gaussian diamond networks","author":"sengupta","year":"2012","journal-title":"IEEE Information Theory Workshop (ITW)"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691348"},{"key":"5","first-page":"377","article-title":"Achieving the capacity of the n-relay gaussian diamond network within log n bits","author":"chern","year":"2012","journal-title":"IEEE Information Theory Workshop (ITW) Lausanne"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513577"},{"journal-title":"Efficient Capacity Computation and Power Optimization for Relay Networks","year":"2011","author":"parvaresh","key":"9"},{"key":"8","first-page":"140","article-title":"Optimized noisy network coding for gaussian relay networks","author":"kolte","year":"2014","journal-title":"IEEE International Zurich Seminar on Communications"}],"event":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2014,9,30]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2014,10,3]]}},"container-title":["2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7008053\/7028426\/07028597.pdf?arnumber=7028597","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T05:02:25Z","timestamp":1498194145000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7028597\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/allerton.2014.7028597","relation":{},"subject":[],"published":{"date-parts":[[2014,9]]}}}