{"id":"https://openalex.org/W3216387773","doi":"https://doi.org/10.1145/3478018","title":"Optimal Bounds for the k -cut Problem","display_name":"Optimal Bounds for the k -cut Problem","publication_year":2021,"publication_date":"2021-11-29","ids":{"openalex":"https://openalex.org/W3216387773","doi":"https://doi.org/10.1145/3478018","mag":"3216387773"},"language":"en","primary_location":{"id":"doi:10.1145/3478018","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3478018","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3478018","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3478018","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101783327","display_name":"David G. Harris","orcid":"https://orcid.org/0000-0002-3021-3555"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David G. Harris","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075423314","display_name":"Euiwoong Lee","orcid":"https://orcid.org/0000-0003-1454-7587"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Euiwoong Lee","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100762970","display_name":"Jason Li","orcid":"https://orcid.org/0000-0002-1150-3549"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jason Li","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2645,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.60955387,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"69","issue":"1","first_page":"1","last_page":"18"},"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.9997000098228455,"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.9997000098228455,"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.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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8139775991439819},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6960017085075378},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6149169206619263},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5825717449188232},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5397570729255676},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4583318829536438},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.43230724334716797},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42815613746643066},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4161613881587982},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4158356189727783}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8139775991439819},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6960017085075378},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6149169206619263},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5825717449188232},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5397570729255676},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4583318829536438},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.43230724334716797},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42815613746643066},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4161613881587982},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4158356189727783},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3478018","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3478018","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3478018","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3478018","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3478018","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3478018","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3216387773.pdf","grobid_xml":"https://content.openalex.org/works/W3216387773.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1971680255","https://openalex.org/W1974139762","https://openalex.org/W1995027289","https://openalex.org/W2016341899","https://openalex.org/W2086565575","https://openalex.org/W2168919539","https://openalex.org/W2747217709","https://openalex.org/W2953221689","https://openalex.org/W2963972775","https://openalex.org/W2964227682","https://openalex.org/W2969859287","https://openalex.org/W2971430063","https://openalex.org/W2978665793","https://openalex.org/W3034552259","https://openalex.org/W3036281379"],"related_works":["https://openalex.org/W3094487424","https://openalex.org/W4389844909","https://openalex.org/W2141353198","https://openalex.org/W2186707160","https://openalex.org/W2129497110","https://openalex.org/W2903538031","https://openalex.org/W2115772827","https://openalex.org/W1974018476","https://openalex.org/W2942946217","https://openalex.org/W1572441411"],"abstract_inverted_index":{"In":[0,104],"the":[1,9,46,109,117,146,165,194,216,231,243,247,251],"k":[2,21,47,58,77,125,131,135,140,144,148,159,162,169,177,181,202,226,228],"-cut":[3,78,126,149],"problem,":[4],"we":[5,107],"want":[6],"to":[7,174,190],"find":[8],"lowest-weight":[10],"set":[11],"of":[12,25,66,96,120,127,157,167,200,218,220,241],"edges":[13],"whose":[14],"deletion":[15],"breaks":[16],"a":[17,238],"given":[18,72],"(multi)graph":[19],"into":[20],"connected":[22],"components.":[23],"Algorithms":[24],"Karger":[26,121,252],"and":[27,69,171],"Stein":[28],"can":[29],"solve":[30],"this":[31,105],"in":[32,79,208],"roughly":[33,179],"O":[34,158],"(":[35,53,136,160],"n":[36,54,80,137,161,180,183],"2k":[37],")":[38,59,163,184],"time.":[39],"However,":[40],"lower":[41,196],"bounds":[42],"from":[43],"conjectures":[44],"about":[45],"-clique":[48],"problem":[49,110],"imply":[50],"that":[51,116],"\u03a9":[52,134],"(1-":[55],"o":[56],"(1))":[57],"time":[60],"is":[61,211,237],"likely":[62],"needed.":[63],"Recent":[64],"results":[65],"Gupta,":[67],"Lee,":[68],"Li":[70],"have":[71],"new":[73],"algorithms":[74,89],"for":[75,93,99,111],"general":[76,112],"1.98k":[81],"+":[82],"O(1)":[83],"time,":[84],"as":[85,87],"well":[86],"specialized":[88],"with":[90,132,178,193],"better":[91],"performance":[92],"certain":[94],"classes":[95],"graphs":[97],"(e.g.,":[98],"small":[100],"integer":[101],"edge":[102],"weights).":[103],"work,":[106],"resolve":[108],"graphs.":[113],"We":[114],"show":[115],"Contraction":[118],"Algorithm":[119],"outputs":[122],"any":[123],"fixed":[124],"weight":[128,221],"\u03b1":[129,139],"\u03bb":[130,143,176,225],"probability":[133],"-":[138],"),":[141],"where":[142],"denotes":[145],"minimum":[147,168],"weight.":[150],"This":[151],"also":[152],"gives":[153],"an":[154,172,212],"extremal":[155,213],"bound":[156,197,214],"on":[164,215],"number":[166,217],"-cuts":[170],"algorithm":[173],"compute":[175],"polylog(":[182],"runtime.":[185],"Both":[186],"are":[187],"tight":[188],"up":[189],"lower-order":[191],"factors,":[192],"algorithmic":[195],"assuming":[198],"hardness":[199],"max-weight":[201],"-clique.":[203],"The":[204,234],"first":[205],"main":[206],"ingredient":[207,236],"our":[209],"result":[210],"cuts":[219],"less":[222],"than":[223],"2":[224],"/":[227],",":[229],"using":[230],"Sunflower":[232],"lemma.":[233],"second":[235],"fine-grained":[239],"analysis":[240],"how":[242,246],"graph":[244],"shrinks\u2014and":[245],"average":[248],"degree":[249],"evolves\u2014in":[250],"process.":[253]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}