{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:21:07Z","timestamp":1725492067057},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/infcom.2011.5935189","type":"proceedings-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T10:59:10Z","timestamp":1310036350000},"page":"391-395","source":"Crossref","is-referenced-by-count":6,"title":["Resource allocation for multicast in an OFDMA network with Random Network Coding"],"prefix":"10.1109","author":[{"given":"Dan","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Narayan","family":"Mandayam","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/26.771345"},{"key":"ref11","article-title":"On coding for reliable communication over packet networks","author":"lun","year":"2004","journal-title":"42nd Annual Allerton Conference on Communication Control and Computing"},{"key":"ref12","article-title":"DEDI: A framework for analyzing rank evolution in random network coding","author":"zhang","year":"2010","journal-title":"IEEE International Symposium on Information Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.904980"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513678"},{"key":"ref15","article-title":"Knapsak Problems: Algorithms and Computer Implementations","author":"martello","year":"1990","journal-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization"},{"article-title":"Network Optimization: Continuous and Discrete Models","year":"1998","author":"bertsekas","key":"ref16"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1090\/conm\/352\/07","article-title":"Graph Colorings","author":"kubale","year":"2004","journal-title":"Contemporary Mathematics"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/49.793310"},{"key":"ref3","article-title":"Packing Steiner trees","author":"jain","year":"2003","journal-title":"Proc ACM-SIAM Symposium on Discrete Algorithms (SODA"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2004.843067"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/RWS.2009.4957364"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2009.03.015"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-009-9754-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228459"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874523"}],"event":{"name":"IEEE INFOCOM 2011 - IEEE Conference on Computer Communications","start":{"date-parts":[[2011,4,10]]},"location":"Shanghai, China","end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5888673\/5934870\/05935189.pdf?arnumber=5935189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T22:55:59Z","timestamp":1497912959000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5935189\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/infcom.2011.5935189","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}