{"id":"https://openalex.org/W7139121605","doi":"https://doi.org/10.1109/globecom59602.2025.11432044","title":"A Sequential Min-Max K-Cut Approach for Load-Balanced Clustered Cell-Free Networking","display_name":"A Sequential Min-Max K-Cut Approach for Load-Balanced Clustered Cell-Free Networking","publication_year":2025,"publication_date":"2025-12-08","ids":{"openalex":"https://openalex.org/W7139121605","doi":"https://doi.org/10.1109/globecom59602.2025.11432044"},"language":null,"primary_location":{"id":"doi:10.1109/globecom59602.2025.11432044","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11432044","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113196435","display_name":"Jingchen Peng","orcid":null},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jingchen Peng","raw_affiliation_strings":["Tsinghua University,Department of Mathematical Sciences,Beijing,China"],"affiliations":[{"raw_affiliation_string":"Tsinghua University,Department of Mathematical Sciences,Beijing,China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102876995","display_name":"Chao Deng","orcid":"https://orcid.org/0000-0003-4402-5587"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chaowen Deng","raw_affiliation_strings":["Tsinghua University,Department of Mathematical Sciences,Beijing,China"],"affiliations":[{"raw_affiliation_string":"Tsinghua University,Department of Mathematical Sciences,Beijing,China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130198771","display_name":"Boxiang Ren","orcid":null},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Boxiang Ren","raw_affiliation_strings":["Tsinghua University,Department of Mathematical Sciences,Beijing,China"],"affiliations":[{"raw_affiliation_string":"Tsinghua University,Department of Mathematical Sciences,Beijing,China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087353591","display_name":"Zhigang Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hao Wu","raw_affiliation_strings":["Tsinghua University,Department of Mathematical Sciences,Beijing,China"],"affiliations":[{"raw_affiliation_string":"Tsinghua University,Department of Mathematical Sciences,Beijing,China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5130044593","display_name":"Junyuan Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I116953780","display_name":"Tongji University","ror":"https://ror.org/03rc6as71","country_code":"CN","type":"education","lineage":["https://openalex.org/I116953780"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Junyuan Wang","raw_affiliation_strings":["Tongji University,College of Electronic and Information Engineering,Shanghai,China"],"affiliations":[{"raw_affiliation_string":"Tongji University,College of Electronic and Information Engineering,Shanghai,China","institution_ids":["https://openalex.org/I116953780"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5113196435"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.68124022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"6172","last_page":"6177"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.6818000078201294,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.6818000078201294,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.12020000070333481,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.05310000106692314,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subnetwork","display_name":"Subnetwork","score":0.7285000085830688},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5899999737739563},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42410001158714294},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4198000133037567},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.41589999198913574},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.38269999623298645},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.3700999915599823},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.35830000042915344},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.3521000146865845}],"concepts":[{"id":"https://openalex.org/C2780186347","wikidata":"https://www.wikidata.org/wiki/Q11414","display_name":"Subnetwork","level":2,"score":0.7285000085830688},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6949999928474426},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5899999737739563},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42410001158714294},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4198000133037567},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.41589999198913574},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.38269999623298645},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3700999915599823},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36320000886917114},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.35830000042915344},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.3521000146865845},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.32499998807907104},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.32100000977516174},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3116999864578247},{"id":"https://openalex.org/C153646914","wikidata":"https://www.wikidata.org/wiki/Q535695","display_name":"Cellular network","level":2,"score":0.30889999866485596},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3070000112056732},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3070000112056732},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28940001130104065},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2874000072479248},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2870999872684479},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.2858000099658966},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.2847000062465668},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.26989999413490295},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25870001316070557},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/globecom59602.2025.11432044","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11432044","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W151367487","https://openalex.org/W1578444888","https://openalex.org/W1971630691","https://openalex.org/W2006023152","https://openalex.org/W2286275639","https://openalex.org/W2552433728","https://openalex.org/W2744331595","https://openalex.org/W2788350651","https://openalex.org/W2788428941","https://openalex.org/W2964338899","https://openalex.org/W3100811607","https://openalex.org/W3104857151","https://openalex.org/W4226150945","https://openalex.org/W4301171817","https://openalex.org/W4315473087","https://openalex.org/W4401693259","https://openalex.org/W4402156554","https://openalex.org/W4404627554","https://openalex.org/W4405023105","https://openalex.org/W4409659738","https://openalex.org/W4410229344"],"related_works":[],"abstract_inverted_index":{"Clustered":[0],"cell-free":[1,73],"networking":[2,74],"is":[3,118],"a":[4,95,106,113,130],"promising":[5],"paradigm":[6],"for":[7],"future":[8],"mobile":[9],"communication":[10],"systems,":[11],"which":[12],"dynamically":[13],"partitions":[14],"the":[15,24,55,69,77,81,103,150,158],"whole":[16],"network":[17,32,57],"into":[18,105],"multiple":[19],"small":[20],"subnetworks":[21],"to":[22,49,90,120],"avoid":[23],"cell-edge":[25],"problem":[26,52,75,104],"in":[27],"cellular":[28],"networks.":[29],"To":[30],"optimize":[31],"partition,":[33],"previous":[34,91],"approaches":[35],"primarily":[36],"relied":[37],"on":[38,68],"heuristics":[39],"and":[40,100],"relaxation":[41],"techniques.":[42],"Recent":[43],"studies":[44],"leveraged":[45],"graph":[46,98],"partitioning":[47],"theory":[48],"address":[50],"this":[51,64],"by":[53,147],"representing":[54],"wireless":[56],"as":[58],"an":[59],"undirected":[60],"bipartite":[61],"graph.":[62],"In":[63,88],"paper,":[65],"we":[66,93,128],"focus":[67],"load":[70],"balanced":[71,115],"clustered":[72],"with":[76,135],"objective":[78],"of":[79,108,160],"maximizing":[80],"minimum":[82,151],"sum":[83,153],"rate":[84],"among":[85],"all":[86],"subnetworks.":[87,161],"contrast":[89],"works,":[92],"propose":[94],"new":[96],"directed":[97],"model":[99],"equivalently":[101],"transform":[102],"sequence":[107],"min-max":[109,122,132],"K-cut":[110,123,133],"problems.":[111,124],"Subsequently,":[112],"streaming":[114],"assignment":[116],"algorithm":[117],"proposed":[119],"solve":[121],"Building":[125],"upon":[126],"this,":[127],"develop":[129],"sequential":[131],"approach":[134],"theoretical":[136],"guarantees.":[137],"Simulation":[138],"results":[139],"demonstrate":[140],"that":[141],"our":[142],"method":[143],"outperforms":[144],"existing":[145],"algorithms":[146],"significantly":[148],"improving":[149],"subnetwork":[152],"rate,":[154],"thereby":[155],"effectively":[156],"balancing":[157],"loads":[159]},"counts_by_year":[],"updated_date":"2026-03-20T20:54:20.808490","created_date":"2026-03-20T00:00:00"}
