{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:35:37Z","timestamp":1725503737142},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/infocom.2018.8486389","type":"proceedings-article","created":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T18:45:36Z","timestamp":1539888336000},"page":"2312-2320","source":"Crossref","is-referenced-by-count":0,"title":["Joint Selection and Scheduling of Communication Requests in Multi-Channel Wireless Networks under SINR Model"],"prefix":"10.1109","author":[{"given":"Peng-Jun","family":"Wan","sequence":"first","affiliation":[]},{"given":"Huaqiang","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Jiliang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ju","family":"Ren","sequence":"additional","affiliation":[]},{"given":"Yaoxue","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"1549","article-title":"A constant-factor approximation for wireless capacity maximization with power control in the SINR model","author":"kesselheim","year":"2011","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"year":"2012","author":"kesselheim","journal-title":"Approximation Algorithms for Spectrum Allocation and Power Control in Wireless Networks","key":"ref11"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1007\/978-3-642-39701-1_6"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1145\/2942358.2942378"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/INFCOM.2011.5935307"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/INFCOM.2013.6566750"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/INFOCOM.2017.8056982"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1145\/2151171.2151177"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1137\/S0097539799354138"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/502102.502107"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1016\/j.disopt.2006.05.010"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1137\/050625382"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1145\/1288107.1288122"},{"year":"1979","author":"garey","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","key":"ref7"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/INFCOM.2009.5062048"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1007\/978-1-4757-3613-7_23"},{"key":"ref9","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"}],"event":{"name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications","start":{"date-parts":[[2018,4,16]]},"location":"Honolulu, HI","end":{"date-parts":[[2018,4,19]]}},"container-title":["IEEE INFOCOM 2018 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8464035\/8485803\/08486389.pdf?arnumber=8486389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T19:02:29Z","timestamp":1640286149000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8486389\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/infocom.2018.8486389","relation":{},"subject":[],"published":{"date-parts":[[2018,4]]}}}