{"id":"https://openalex.org/W4285787231","doi":"https://doi.org/10.1145/3796220","title":"A Tight Quasi-Polynomial Bound for Global Label Min-Cut","display_name":"A Tight Quasi-Polynomial Bound for Global Label Min-Cut","publication_year":2026,"publication_date":"2026-02-11","ids":{"openalex":"https://openalex.org/W4285787231","doi":"https://doi.org/10.1145/3796220"},"language":"en","primary_location":{"id":"doi:10.1145/3796220","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3796220","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2207.07426","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039626432","display_name":"Lars Jaffke","orcid":"https://orcid.org/0000-0003-4856-5863"},"institutions":[{"id":"https://openalex.org/I931913249","display_name":"Norwegian School of Economics","ror":"https://ror.org/04v53s997","country_code":"NO","type":"education","lineage":["https://openalex.org/I931913249"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Lars Jaffke","raw_affiliation_strings":["NHH Norwegian School of Economics, Bergen, Norway"],"raw_orcid":"https://orcid.org/0000-0003-4856-5863","affiliations":[{"raw_affiliation_string":"NHH Norwegian School of Economics, Bergen, Norway","institution_ids":["https://openalex.org/I931913249"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091558578","display_name":"Paloma T. Lima","orcid":"https://orcid.org/0000-0001-9304-4536"},"institutions":[{"id":"https://openalex.org/I931913249","display_name":"Norwegian School of Economics","ror":"https://ror.org/04v53s997","country_code":"NO","type":"education","lineage":["https://openalex.org/I931913249"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Paloma T. de Lima","raw_affiliation_strings":["NHH Norwegian School of Economics, Bergen, Norway and IT University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-9304-4536","affiliations":[{"raw_affiliation_string":"NHH Norwegian School of Economics, Bergen, Norway and IT University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I931913249"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027217082","display_name":"Tom\u00e1\u0161 Masa\u0159\u00edk","orcid":"https://orcid.org/0000-0001-8524-4036"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Tom\u00e1\u0161 Masa\u0159\u00edk","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland"],"raw_orcid":"https://orcid.org/0000-0001-8524-4036","affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059330513","display_name":"Marcin Pilipczuk","orcid":"https://orcid.org/0000-0001-5680-7397"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marcin Pilipczuk","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland"],"raw_orcid":"https://orcid.org/0000-0001-5680-7397","affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077019769","display_name":"U\u00e9verton S. Souza","orcid":"https://orcid.org/0000-0002-5320-9209"},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Uev\u00e9rton S. Souza","raw_affiliation_strings":["Fluminense Federal University, Niteroi, Brazil, IMPA, Rio de Janeiro, Brazil, and University of Warsaw, Warsaw, Poland"],"raw_orcid":"https://orcid.org/0000-0002-5320-9209","affiliations":[{"raw_affiliation_string":"Fluminense Federal University, Niteroi, Brazil, IMPA, Rio de Janeiro, Brazil, and University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I161127581"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00266366,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"22","issue":"2","first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7128691673278809},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7053921818733215},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6489095091819763},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.620861828327179},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5598865747451782},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5294681787490845},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5015053749084473},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4774121046066284},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.43205592036247253},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.43133318424224854},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4298778474330902},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4148717522621155}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7128691673278809},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7053921818733215},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6489095091819763},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.620861828327179},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5598865747451782},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5294681787490845},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5015053749084473},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4774121046066284},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.43205592036247253},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.43133318424224854},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4298778474330902},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4148717522621155},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3796220","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3796220","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2207.07426","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2207.07426","pdf_url":"https://arxiv.org/pdf/2207.07426","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2207.07426","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2207.07426","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2207.07426","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2207.07426","pdf_url":"https://arxiv.org/pdf/2207.07426","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5244030528","display_name":null,"funder_award_id":"714704","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W2181191890","https://openalex.org/W2604916921","https://openalex.org/W4390098007","https://openalex.org/W2984493948","https://openalex.org/W4409280356","https://openalex.org/W1983740291","https://openalex.org/W1929341507","https://openalex.org/W2095819433","https://openalex.org/W4213060883","https://openalex.org/W3126714247","https://openalex.org/W3037081898","https://openalex.org/W2922372630","https://openalex.org/W1995725694","https://openalex.org/W4316652342","https://openalex.org/W1964510837","https://openalex.org/W4390590029","https://openalex.org/W3126916987","https://openalex.org/W2963751092","https://openalex.org/W2150004999","https://openalex.org/W1927738121","https://openalex.org/W2035228443","https://openalex.org/W2043525538","https://openalex.org/W1557119628","https://openalex.org/W2057463094","https://openalex.org/W86974874","https://openalex.org/W168251437","https://openalex.org/W2016115187","https://openalex.org/W2475817483","https://openalex.org/W2566743541","https://openalex.org/W3011053358"],"related_works":["https://openalex.org/W4389156785","https://openalex.org/W2113885662","https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W1862126075","https://openalex.org/W2113623403","https://openalex.org/W2914832887","https://openalex.org/W2055932080","https://openalex.org/W2177663427","https://openalex.org/W2000333212"],"abstract_inverted_index":{"We":[0,103,112,135],"study":[1,115],"a":[2,84,184],"generalization":[3],"of":[4,22,39,66,116,119,140,162,171,198],"the":[5,20,23,40,46,56,62,67,75,110,114,117,120,128,138,151,160,169,174,180,196,205,210,222],"classic":[6],"Global":[7,11,16,121,187],"Min-Cut":[8,13,18,123,189],"problem,":[9],"called":[10],"Label":[12,122,188],"(or":[14,28],"sometimes":[15],"Hedge":[17],"):":[19],"edges":[21,38],"input":[24],"(multi)graph":[25],"are":[26],"labeled":[27],"partitioned":[29],"into":[30],"color":[31],"classes":[32],"or":[33,44],"hedges),":[34],"and":[35,164],"removing":[36],"all":[37,214],"same":[41,47],"label":[42],"(color":[43],"from":[45],"hedge)":[48],"costs":[49],"one.":[50],"The":[51,176],"problem":[52,68,98,124,206],"asks":[53],"to":[54,71,82,217,220],"disconnect":[55,221],"graph":[57],"at":[58],"minimum":[59],"cost.":[60],"While":[61],"\\(st\\)":[63],"-cut":[64],"version":[65,79],"is":[69,80,99,107,132,159,168,183,190,207],"known":[70,81],"be":[72,218],"\\(\\textsf{NP}\\)":[73],"-hard,":[74],"above":[76],"global":[77],"cut":[78,219],"admit":[83],"quasi-polynomial":[85,129],"randomized":[86],"\\(n^{\\mathcal{O}(\\log\\mathrm{OPT})}\\)":[87],"-time":[88],"algorithm.":[89],"They":[90],"consider":[91],"this":[92,97,106],"as":[93],"\u201cstrong":[94],"evidence":[95],"that":[96,105,127,137,186],"in":[100,173,209],"\\(\\textsf{P}\\)":[101],".\u201d":[102],"show":[104,136],"actually":[108],"not":[109],"case.":[111],"complete":[113],"complexity":[118],"by":[125,195],"showing":[126],"running":[130,144],"time":[131,145],"probably":[133],"optimal:":[134],"existence":[139],"an":[141],"algorithm":[142],"with":[143],"\\((np)^{o(\\log":[146],"n/(\\log\\log":[147],"n)^{2})}\\)":[148],"would":[149],"contradict":[150],"Exponential":[152],"Time":[153],"Hypothesis,":[154],"where":[155,212],"\\(":[156,165],"n":[157],"\\)":[158,167],"number":[161,170,197],"vertices,":[163],"p":[166],"labels":[172,200,215],"input.":[175],"key":[177],"step":[178],"for":[179],"lower":[181],"bound":[182],"proof":[185],"\\(\\textsf{W}\\)":[191],"[1]-hard":[192],"when":[193],"parameterized":[194],"uncut":[199],".":[201],"In":[202],"other":[203],"words,":[204],"difficult":[208],"regime":[211],"almost":[213],"need":[216],"graph.":[223]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-21T08:15:58.654021","created_date":"2022-07-19T00:00:00"}