{"id":"https://openalex.org/W3034552259","doi":"https://doi.org/10.1145/3357713.3384285","title":"The Karger-Stein algorithm is optimal for k-cut","display_name":"The Karger-Stein algorithm is optimal for k-cut","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3034552259","doi":"https://doi.org/10.1145/3357713.3384285","mag":"3034552259"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384285","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384285","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384285","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384285","any_repository_has_fulltext":null},"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":true,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["Carnegie Mellon University, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"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/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Euiwoong Lee","raw_affiliation_strings":["New York University, USA"],"affiliations":[{"raw_affiliation_string":"New York University, USA","institution_ids":["https://openalex.org/I57206974"]}]},{"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, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5078381067"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.8293,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.88595496,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"473","last_page":"484"},"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.9998000264167786,"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.9998000264167786,"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.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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9988999962806702,"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.7964816093444824},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6934593915939331},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5744791626930237},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.5436981320381165},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5401742458343506},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.525606632232666},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4610324203968048},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.460989773273468},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4534667730331421},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.439251184463501},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33299845457077026},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27030113339424133}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7964816093444824},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6934593915939331},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5744791626930237},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.5436981320381165},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5401742458343506},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.525606632232666},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4610324203968048},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.460989773273468},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4534667730331421},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.439251184463501},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33299845457077026},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27030113339424133},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3357713.3384285","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384285","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384285","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3357713.3384285","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384285","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384285","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd 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/W3034552259.pdf","grobid_xml":"https://content.openalex.org/works/W3034552259.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1995027289","https://openalex.org/W2016341899","https://openalex.org/W2035228443","https://openalex.org/W2083459869","https://openalex.org/W2167637346","https://openalex.org/W2168919539","https://openalex.org/W2953221689","https://openalex.org/W2964227682","https://openalex.org/W2971430063","https://openalex.org/W2978761408","https://openalex.org/W6753784571","https://openalex.org/W6981086012"],"related_works":["https://openalex.org/W2141353198","https://openalex.org/W2115772827","https://openalex.org/W2186707160","https://openalex.org/W2129497110","https://openalex.org/W2903538031","https://openalex.org/W4289685524","https://openalex.org/W2885987986","https://openalex.org/W2068595367","https://openalex.org/W3184379502","https://openalex.org/W3138812705"],"abstract_inverted_index":{"In":[0],"the":[1,14,22,55,58,90],"k-cut":[2,41,72],"problem,":[3],"we":[4],"are":[5],"given":[6,85],"an":[7],"edge-weighted":[8],"graph":[9,23],"and":[10,32,61,68,98],"want":[11],"to":[12,30,36,66,75],"find":[13,37],"least-weight":[15],"set":[16],"of":[17,57,107],"edges":[18],"whose":[19],"deletion":[20],"breaks":[21],"into":[24],"k":[25,79],"connected":[26],"components.":[27],"Algorithms":[28],"due":[29],"Karger-Stein":[31],"Thorup":[33],"showed":[34],"how":[35],"such":[38],"a":[39,62],"minimum":[40],"in":[42,92],"time":[43,77,93],"approximately":[44],"O(n":[45],"2k\u22122).":[46],"The":[47],"best":[48],"lower":[49],"bounds":[50],"come":[51],"from":[52,64],"conjectures":[53],"about":[54],"solvability":[56],"k-clique":[59,65],"problem":[60,91],"reduction":[63],"k-cut,":[67],"show":[69],"that":[70,88,100],"solving":[71],"is":[73],"likely":[74],"require":[76],"\u03a9(n":[78],").":[80],"Our":[81],"recent":[82],"results":[83],"have":[84,101],"special-purpose":[86],"algorithms":[87],"solve":[89],"n":[94],"1.98k":[95],"+":[96],"O(1),":[97],"ones":[99],"better":[102],"performance":[103],"for":[104,110],"special":[105],"classes":[106],"graphs":[108],"(e.g.,":[109],"small":[111],"integer":[112],"weights).":[113]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}