{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:51:22Z","timestamp":1725555082565},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.23919\/wiopt.2017.7959908","type":"proceedings-article","created":{"date-parts":[[2017,6,29]],"date-time":"2017-06-29T17:20:12Z","timestamp":1498756812000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["A maximum dispersion approach for rate feasibility problems in SINR model"],"prefix":"10.23919","author":[{"given":"Shashi","family":"Prabh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/TNET.2010.2047511"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TNET.2010.2048338"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1137\/1.9781611973082.120"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TNET.2013.2258036"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1145\/1400863.1400874"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/INFCOM.2012.6195680"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/INFCOM.2010.5462119"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1561\/1300000030"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1016\/0020-0190(88)90174-3"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1287\/opre.42.2.299"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/WIOPT.2016.7492937"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TNET.2012.2210240"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1145\/1132905.1132939"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/TIT.2006.883617"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/INFOCOM.2008.172"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1145\/1288107.1288122"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TCOMM.2009.09.080145"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/ISIT.2016.7541538"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/INFCOM.2009.5062048"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1145\/2213556.2213580"},{"key":"ref22","first-page":"292","author":"gens","year":"1979","journal-title":"Computational complexity of approximation algorithms for combinatorial problems"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/9.182479"}],"event":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","start":{"date-parts":[[2017,5,15]]},"location":"Paris, France","end":{"date-parts":[[2017,5,19]]}},"container-title":["2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7951216\/7959854\/07959908.pdf?arnumber=7959908","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,12]],"date-time":"2017-07-12T00:24:43Z","timestamp":1499819083000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7959908\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":22,"URL":"https:\/\/doi.org\/10.23919\/wiopt.2017.7959908","relation":{},"subject":[],"published":{"date-parts":[[2017,5]]}}}