{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T18:10:59Z","timestamp":1725387059613},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1109\/glocom.2017.8254979","type":"proceedings-article","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T17:50:54Z","timestamp":1516038654000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Low Complexity Node Clustering in Cloud-RAN for Service Provisioning and Resource Allocation"],"prefix":"10.1109","author":[{"given":"Haining","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Priyesh","family":"Shetty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/TMC.2014.2343976"},{"year":"2004","author":"golumbic","journal-title":"Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics Vol 57)","key":"ref11"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"ref13","article-title":"Maximal cliques in unit disk graphs: Polynomial approximation","author":"gupta","year":"2005","journal-title":"Proc INOC"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/DYSPAN.2007.12"},{"key":"ref15","first-page":"1","article-title":"ch. Lexicographic breadth first search &#x2014; a survey","author":"corneil","year":"2005","journal-title":"Graph-Theoretic Concepts in Computer Science"},{"year":"0","author":"mneimneh","journal-title":"Depth \/ breadth first search with applications","key":"ref16"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1137\/1.9780898719796"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/TCOMM.2015.2397888"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/ACCESS.2014.2360555"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TWC.2013.040413.120676"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/VTCFall.2013.6692078"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TWC.2014.2379282"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TNET.2014.2345875"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/COMST.2014.2355255"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/ACCESS.2015.2422266"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/WCSP.2014.6992151"}],"event":{"name":"2017 IEEE Global Communications Conference (GLOBECOM 2017)","start":{"date-parts":[[2017,12,4]]},"location":"Singapore","end":{"date-parts":[[2017,12,8]]}},"container-title":["GLOBECOM 2017 - 2017 IEEE Global Communications Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253768\/8253909\/08254979.pdf?arnumber=8254979","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,19]],"date-time":"2018-02-19T19:12:21Z","timestamp":1519067541000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8254979\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/glocom.2017.8254979","relation":{},"subject":[],"published":{"date-parts":[[2017,12]]}}}