{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T21:36:10Z","timestamp":1774042570318,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,12,8]]},"DOI":"10.1109\/globecom59602.2025.11432044","type":"proceedings-article","created":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T20:04:01Z","timestamp":1773950641000},"page":"6172-6177","source":"Crossref","is-referenced-by-count":0,"title":["A Sequential Min-Max K-Cut Approach for Load-Balanced Clustered Cell-Free Networking"],"prefix":"10.1109","author":[{"given":"Jingchen","family":"Peng","sequence":"first","affiliation":[{"name":"Tsinghua University,Department of Mathematical Sciences,Beijing,China"}]},{"given":"Chaowen","family":"Deng","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Mathematical Sciences,Beijing,China"}]},{"given":"Boxiang","family":"Ren","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Mathematical Sciences,Beijing,China"}]},{"given":"Hao","family":"Wu","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Mathematical Sciences,Beijing,China"}]},{"given":"Junyuan","family":"Wang","sequence":"additional","affiliation":[{"name":"Tongji University,College of Electronic and Information Engineering,Shanghai,China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2018.1700483"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2015.2497678"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2655515"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2704095"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3233444"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3164286"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICC45855.2022.9839089"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2025.3563220"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619648"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC61545.2025.10978229"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2024.3496733"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2024.3511536"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICC51166.2024.10622541"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2812748"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2812733"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2016.2626366"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511734885.006"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10062"},{"issue":"94","key":"ref19","first-page":"221","article-title":"The complexity of the bottleneck graph bipartition problem","volume":"15","author":"Shahrokhi","year":"1994","journal-title":"J. Combin. Math. Combin. Comp"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01842-3"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339722"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556213"}],"event":{"name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","location":"Taipei, Taiwan","start":{"date-parts":[[2025,12,8]]},"end":{"date-parts":[[2025,12,12]]}},"container-title":["GLOBECOM 2025 - 2025 IEEE Global Communications Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11431620\/11431622\/11432044.pdf?arnumber=11432044","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T19:55:38Z","timestamp":1774036538000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11432044\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/globecom59602.2025.11432044","relation":{},"subject":[],"published":{"date-parts":[[2025,12,8]]}}}