{"id":"https://openalex.org/W3212220454","doi":"https://doi.org/10.1145/3519935.3519948","title":"Breaking the <i> n <sup>k</sup> </i> barrier for minimum <i>k</i> -cut on simple graphs","display_name":"Breaking the <i> n <sup>k</sup> </i> barrier for minimum <i>k</i> -cut on simple graphs","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W3212220454","doi":"https://doi.org/10.1145/3519935.3519948","mag":"3212220454"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3519948","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3519948","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3519948","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3519948","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047512906","display_name":"Zhiyang He","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zhiyang He","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"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/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jason Li","raw_affiliation_strings":["University of California at Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047512906"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02024231,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"131","last_page":"136"},"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.9995999932289124,"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.9995999932289124,"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.9979000091552734,"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/T10237","display_name":"Cryptography and Data Security","score":0.9959999918937683,"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/combinatorics","display_name":"Combinatorics","score":0.7569461464881897},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6356346607208252},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.5895541310310364},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48544198274612427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45388537645339966},{"id":"https://openalex.org/keywords/simple-graph","display_name":"Simple graph","score":0.45152607560157776},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4128759503364563},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.057727038860321045}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7569461464881897},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6356346607208252},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.5895541310310364},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48544198274612427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45388537645339966},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.45152607560157776},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4128759503364563},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.057727038860321045},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519935.3519948","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3519948","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3519948","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3519935.3519948","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519935.3519948","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519935.3519948","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3212220454.pdf","grobid_xml":"https://content.openalex.org/works/W3212220454.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W104109059","https://openalex.org/W1995027289","https://openalex.org/W2030460280","https://openalex.org/W2035228443","https://openalex.org/W2086565575","https://openalex.org/W2122466336","https://openalex.org/W2130045784","https://openalex.org/W2167637346","https://openalex.org/W2168919539","https://openalex.org/W2953221689","https://openalex.org/W2963972775","https://openalex.org/W2964227682","https://openalex.org/W2971430063","https://openalex.org/W3024975976","https://openalex.org/W3116253690","https://openalex.org/W3116655994","https://openalex.org/W3128537420","https://openalex.org/W3216387773"],"related_works":["https://openalex.org/W2897806428","https://openalex.org/W2391518723","https://openalex.org/W3014749936","https://openalex.org/W2805115653","https://openalex.org/W1996149838","https://openalex.org/W4205475737","https://openalex.org/W2364012696","https://openalex.org/W2622512907","https://openalex.org/W4312839729","https://openalex.org/W3189256254"],"abstract_inverted_index":{"In":[0],"the":[1,9,17,43],"minimum":[2,10],"k-cut":[3],"problem,":[4],"we":[5],"want":[6],"to":[7,46],"find":[8],"number":[11],"of":[12,29],"edges":[13],"whose":[14],"deletion":[15],"breaks":[16],"input":[18],"graph":[19],"into":[20],"at":[21],"least":[22],"k":[23],"connected":[24],"components.":[25],"The":[26],"classic":[27],"algorithm":[28],"Karger":[30],"and":[31,37],"Stein":[32],"runs":[33],"in":[34],"\u00d5(n2k\u22122)":[35],"time,":[36],"recent,":[38],"exciting":[39],"developments":[40],"have":[41],"improved":[42],"running":[44],"time":[45],"O(nk).":[47],"For":[48],"general,":[49],"weighted":[50],"graphs,":[51],"this":[52],"is":[53],"tight":[54],"assuming":[55],"popular":[56],"hardness":[57],"conjectures.":[58]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}