{"id":"https://openalex.org/W2953221689","doi":"https://doi.org/10.1145/3313276.3316395","title":"The number of minimum <i>k</i> -cuts: improving the Karger-Stein bound","display_name":"The number of minimum <i>k</i> -cuts: improving the Karger-Stein bound","publication_year":2019,"publication_date":"2019-06-20","ids":{"openalex":"https://openalex.org/W2953221689","doi":"https://doi.org/10.1145/3313276.3316395","mag":"2953221689"},"language":"en","primary_location":{"id":"doi:10.1145/3313276.3316395","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316395","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316395","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st 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/3313276.3316395","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.9996,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.87766782,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"229","last_page":"240"},"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.9998999834060669,"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.9998999834060669,"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.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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9997000098228455,"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.652287483215332},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.5739811062812805},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5468348264694214},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49686482548713684},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.49241530895233154},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4921247363090515},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.48957356810569763},{"id":"https://openalex.org/keywords/extremal-graph-theory","display_name":"Extremal graph theory","score":0.48639705777168274},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4374575912952423},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43617311120033264},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4288775324821472},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32252639532089233},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1800779402256012},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.1344982087612152},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07571709156036377}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.652287483215332},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.5739811062812805},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5468348264694214},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49686482548713684},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.49241530895233154},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4921247363090515},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.48957356810569763},{"id":"https://openalex.org/C12595997","wikidata":"https://www.wikidata.org/wiki/Q739245","display_name":"Extremal graph theory","level":5,"score":0.48639705777168274},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4374575912952423},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43617311120033264},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4288775324821472},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32252639532089233},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1800779402256012},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.1344982087612152},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07571709156036377},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3313276.3316395","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316395","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316395","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3313276.3316395","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316395","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316395","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2564752090","display_name":"CCF-BSF: AF: Small: Metric Embeddings and Partitioning for Minor-Closed Graph Families","funder_award_id":"1617790","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3081260677","display_name":null,"funder_award_id":"CCF-1536002","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5049668581","display_name":null,"funder_award_id":"CCF-1617790","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5552157593","display_name":"AitF: FULL: Collaborative Research:  Practical Foundations for Software-Defined Network Optimization","funder_award_id":"1536002","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6290924233","display_name":null,"funder_award_id":"CCF-1536002, CCF-1540541, CCF-1617790,","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7334382270","display_name":"BSF: 2014414: New Challenges and Perspectives in Online Algorithms","funder_award_id":"1540541","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2953221689.pdf","grobid_xml":"https://content.openalex.org/works/W2953221689.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W58927963","https://openalex.org/W1529019776","https://openalex.org/W1562526251","https://openalex.org/W1964510837","https://openalex.org/W1974139762","https://openalex.org/W1990666952","https://openalex.org/W1993449345","https://openalex.org/W1995027289","https://openalex.org/W2030460280","https://openalex.org/W2035228443","https://openalex.org/W2038073775","https://openalex.org/W2061006898","https://openalex.org/W2064211276","https://openalex.org/W2066159238","https://openalex.org/W2084803275","https://openalex.org/W2091264711","https://openalex.org/W2112306992","https://openalex.org/W2120248756","https://openalex.org/W2121204510","https://openalex.org/W2122466336","https://openalex.org/W2125472409","https://openalex.org/W2167637346","https://openalex.org/W2168919539","https://openalex.org/W2264676752","https://openalex.org/W2471129545","https://openalex.org/W2569484595","https://openalex.org/W2741464441","https://openalex.org/W2779965945","https://openalex.org/W2915433949","https://openalex.org/W2963087145","https://openalex.org/W2964227682","https://openalex.org/W2964273566","https://openalex.org/W2996801447"],"related_works":["https://openalex.org/W2141353198","https://openalex.org/W2186707160","https://openalex.org/W1974018476","https://openalex.org/W2903538031","https://openalex.org/W2129497110","https://openalex.org/W2115772827","https://openalex.org/W2942946217","https://openalex.org/W2078695342","https://openalex.org/W1588356204","https://openalex.org/W1572441411"],"abstract_inverted_index":{"Given":[0],"an":[1],"edge-weighted":[2],"graph,":[3],"how":[4],"many":[5],"minimum":[6,45],"k-cuts":[7],"can":[8],"it":[9],"have?":[10],"This":[11],"is":[12,27],"a":[13],"fundamental":[14],"question":[15],"in":[16,30],"the":[17,32,44],"intersection":[18],"of":[19],"algorithms,":[20],"extremal":[21],"combinatorics,":[22],"and":[23],"graph":[24],"theory.":[25],"It":[26],"particularly":[28],"interesting":[29],"that":[31,42],"best":[33],"known":[34],"bounds":[35],"are":[36],"algorithmic:":[37],"they":[38],"stem":[39],"from":[40],"algorithms":[41],"compute":[43],"k-cut.":[46]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}