{"id":"https://openalex.org/W4415370386","doi":"https://doi.org/10.3390/a18100665","title":"A Recursive Solution to the Global Maximum Minimum Cut Problem with a Fixed Sink","display_name":"A Recursive Solution to the Global Maximum Minimum Cut Problem with a Fixed Sink","publication_year":2025,"publication_date":"2025-10-20","ids":{"openalex":"https://openalex.org/W4415370386","doi":"https://doi.org/10.3390/a18100665"},"language":"en","primary_location":{"id":"doi:10.3390/a18100665","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18100665","pdf_url":"https://www.mdpi.com/1999-4893/18/10/665/pdf?version=1760965355","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/18/10/665/pdf?version=1760965355","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031124981","display_name":"Xiaoyao Huang","orcid":"https://orcid.org/0000-0003-2571-1979"},"institutions":[{"id":"https://openalex.org/I4210136246","display_name":"China Telecom (China)","ror":"https://ror.org/03jgnzt20","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210136246"]},{"id":"https://openalex.org/I4210144487","display_name":"Cloud Computing Center","ror":"https://ror.org/04aa0zm65","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210144487"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoyao Huang","raw_affiliation_strings":["China Telecom Cloud Computing Research Institute, Beijing 100083, China"],"raw_orcid":"https://orcid.org/0000-0003-2571-1979","affiliations":[{"raw_affiliation_string":"China Telecom Cloud Computing Research Institute, Beijing 100083, China","institution_ids":["https://openalex.org/I4210136246","https://openalex.org/I4210144487"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040978935","display_name":"Shuo Quan","orcid":"https://orcid.org/0000-0001-8824-631X"},"institutions":[{"id":"https://openalex.org/I4210136246","display_name":"China Telecom (China)","ror":"https://ror.org/03jgnzt20","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210136246"]},{"id":"https://openalex.org/I4210144487","display_name":"Cloud Computing Center","ror":"https://ror.org/04aa0zm65","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210144487"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shuo Quan","raw_affiliation_strings":["China Telecom Cloud Computing Research Institute, Beijing 100083, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"China Telecom Cloud Computing Research Institute, Beijing 100083, China","institution_ids":["https://openalex.org/I4210136246","https://openalex.org/I4210144487"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101721006","display_name":"Jie Wu","orcid":"https://orcid.org/0000-0002-8648-141X"},"institutions":[{"id":"https://openalex.org/I4210136246","display_name":"China Telecom (China)","ror":"https://ror.org/03jgnzt20","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210136246"]},{"id":"https://openalex.org/I4210144487","display_name":"Cloud Computing Center","ror":"https://ror.org/04aa0zm65","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210144487"]},{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["CN","US"],"is_corresponding":true,"raw_author_name":"Jie Wu","raw_affiliation_strings":["China Telecom Cloud Computing Research Institute, Beijing 100083, China","Department of Computer and Information Sciences, Temple University, Philadelphia, PA 19122, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"China Telecom Cloud Computing Research Institute, Beijing 100083, China","institution_ids":["https://openalex.org/I4210136246","https://openalex.org/I4210144487"]},{"raw_affiliation_string":"Department of Computer and Information Sciences, Temple University, Philadelphia, PA 19122, USA","institution_ids":["https://openalex.org/I84392919"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101721006"],"corresponding_institution_ids":["https://openalex.org/I4210136246","https://openalex.org/I4210144487","https://openalex.org/I84392919"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1782},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1782},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.33422806,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"10","first_page":"665","last_page":"665"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12176","display_name":"Optimization and Packing Problems","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11159","display_name":"Manufacturing Process and Optimization","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9842000007629395,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5879999995231628},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.5740000009536743},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5544999837875366},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5533000230789185},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5529000163078308},{"id":"https://openalex.org/keywords/cut","display_name":"Cut","score":0.5374000072479248},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.4823000133037567},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.421999990940094},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.42010000348091125}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5879999995231628},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.5740000009536743},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5544999837875366},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5533000230789185},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5529000163078308},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.539900004863739},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.5374000072479248},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5232999920845032},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.4823000133037567},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4366999864578247},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.421999990940094},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.42010000348091125},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4083000123500824},{"id":"https://openalex.org/C143050476","wikidata":"https://www.wikidata.org/wiki/Q194502","display_name":"Sink (geography)","level":2,"score":0.3953999876976013},{"id":"https://openalex.org/C2778462145","wikidata":"https://www.wikidata.org/wiki/Q5196598","display_name":"Cut-off","level":3,"score":0.38179999589920044},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.35249999165534973},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3398999869823456},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31929999589920044},{"id":"https://openalex.org/C18802822","wikidata":"https://www.wikidata.org/wiki/Q41690","display_name":"Golden ratio","level":2,"score":0.3149999976158142},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.2976999878883362},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.2903999984264374},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2903999984264374},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.2646999955177307},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a18100665","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18100665","pdf_url":"https://www.mdpi.com/1999-4893/18/10/665/pdf?version=1760965355","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:c9db893538c84f11a5b025745011aa9e","is_oa":true,"landing_page_url":"https://doaj.org/article/c9db893538c84f11a5b025745011aa9e","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 18, Iss 10, p 665 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a18100665","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18100665","pdf_url":"https://www.mdpi.com/1999-4893/18/10/665/pdf?version=1760965355","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415370386.pdf","grobid_xml":"https://content.openalex.org/works/W4415370386.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1983383464","https://openalex.org/W1997010704","https://openalex.org/W2090359754","https://openalex.org/W2115049345","https://openalex.org/W2121204510","https://openalex.org/W2149342630","https://openalex.org/W2150187954","https://openalex.org/W2168919539","https://openalex.org/W4213060883"],"related_works":[],"abstract_inverted_index":{"In":[0,112],"graph":[1],"theory":[2],"and":[3,16,145,181,199,236,251,254,280],"network":[4],"design,":[5],"the":[6,27,48,65,76,124,143,156,167,191,204,208,220,224,257],"minimum":[7,28,52,138,209],"cut":[8,29,53,150,189,210],"is":[9,58,95,102,130],"a":[10,31,44,55,80,85,108,117,196,212,244],"fundamental":[11],"measure":[12],"of":[13,78,96,155,169,223,227],"system":[14],"connectivity":[15],"communication":[17,41],"capacity.":[18],"While":[19],"prior":[20],"research":[21],"has":[22],"largely":[23],"focused":[24],"on":[25,187,278],"computing":[26],"for":[30,122,202],"fixed":[32,213],"source\u2013sink":[33],"pair,":[34],"practical":[35],"scenarios":[36],"such":[37],"as":[38,105],"data":[39],"center":[40],"often":[42],"demand":[43],"different":[45],"objective:":[46],"identifying":[47,203],"source":[49,82,205],"node":[50,88],"whose":[51,149],"to":[54,84,131,142,211,232],"designated":[56],"sink":[57,87,225],"maximized.":[59],"This":[60],"task,":[61],"which":[62,230],"we":[63,115,255],"term":[64],"Global":[66],"Maximum":[67],"Minimum":[68],"Cut":[69],"with":[70,140,178],"Fixed":[71],"Sink":[72],"(GMMC-FS)":[73],"problem,":[74],"captures":[75],"goal":[77],"locating":[79],"high-capacity":[81],"relative":[83],"shared":[86],"that":[89,154,185,206,264],"aggregates":[90],"multiple":[91],"servers.":[92],"The":[93,127],"problem":[94],"significant":[97],"engineering":[98],"importance,":[99],"yet":[100],"it":[101,106],"computationally":[103],"challenging":[104],"involves":[107],"nested":[109],"max\u2013min":[110],"optimization.":[111],"this":[113,161],"paper,":[114],"present":[116],"recursive":[118],"reduction":[119],"(RR)":[120],"algorithm":[121],"solving":[123],"GMMC-FS":[125],"problem.":[126],"key":[128],"idea":[129],"iteratively":[132],"select":[133],"pivot":[134],"nodes,":[135],"compute":[136],"their":[137],"cuts":[139],"respect":[141],"sink,":[144],"prune":[146],"dominated":[147],"candidates":[148],"values":[151],"cannot":[152],"exceed":[153],"pivot.":[157],"By":[158],"recursively":[159],"applying":[160],"elimination":[162],"process,":[163],"RR":[164,193,265],"dramatically":[165],"reduces":[166],"number":[168],"max-flow":[170],"computations":[171],"required":[172],"while":[173,270],"preserving":[174],"exact":[175],"correctness.":[176],"Compared":[177],"classical":[179],"contraction-based":[180],"Gomory\u2013Hu":[182],"tree":[183],"approaches":[184],"rely":[186],"global":[188],"enumeration,":[190],"proposed":[192],"framework":[194],"offers":[195],"more":[197],"direct":[198],"scalable":[200],"mechanism":[201],"maximizes":[207],"sink.":[214],"Its":[215],"novelty":[216],"lies":[217],"in":[218,275],"exploiting":[219],"structural":[221],"properties":[222],"side":[226],"suboptimal":[228],"cuts,":[229],"leads":[231],"both":[233,249],"theoretical":[234,246],"efficiency":[235],"empirical":[237],"robustness":[238],"across":[239],"large-scale":[240],"networks.":[241,282],"We":[242],"provide":[243],"rigorous":[245],"analysis":[247],"establishing":[248],"correctness":[250],"complexity":[252],"bounds,":[253],"validate":[256],"approach":[258],"through":[259],"extensive":[260],"experiments.":[261],"Results":[262],"demonstrate":[263],"consistently":[266],"achieves":[267],"optimal":[268],"solutions":[269],"significantly":[271],"outperforming":[272],"baseline":[273],"methods":[274],"runtime,":[276],"particularly":[277],"large":[279],"dense":[281]},"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-21T00:00:00"}