{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:36:56Z","timestamp":1766137016461,"version":"3.37.3"},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Fonds de Recherche du Qu\u00e9bec\u2013Nature et Technologies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/lcomm.2018.2840714","type":"journal-article","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T18:42:21Z","timestamp":1527273741000},"page":"1672-1675","source":"Crossref","is-referenced-by-count":6,"title":["User Association Under SINR Constraints in HetNets: Upper Bound and NP-Hardness"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3417-7704","authenticated-orcid":false,"given":"Zoubeir","family":"Mlika","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elmahdi","family":"Driouch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4409-9447","authenticated-orcid":false,"given":"Wessam","family":"Ajib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2547956"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2416971"},{"key":"ref10","first-page":"1538","article-title":"Wireless capacity with oblivious power in general metrics","author":"halld\ufffdrsson","year":"2011","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1997.612321"},{"journal-title":"Approximation Algorithms","year":"2010","author":"vazirani","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2686839"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2015.2395093"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.2328098"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2544478"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2016.2558501"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/8432073\/08365783.pdf?arnumber=8365783","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T13:16:08Z","timestamp":1643202968000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8365783\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":10,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2018.2840714","relation":{},"ISSN":["1089-7798","1558-2558","2373-7891"],"issn-type":[{"type":"print","value":"1089-7798"},{"type":"electronic","value":"1558-2558"},{"type":"electronic","value":"2373-7891"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}