{"id":"https://openalex.org/W4225947064","doi":"https://doi.org/10.4086/toc.2022.v018a007","title":"","display_name":"","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4225947064","doi":"https://doi.org/10.4086/toc.2022.v018a007"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2022.v018a007","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2022.v018a007","pdf_url":"https://theoryofcomputing.org/articles/v018a007/v018a007.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v018a007/v018a007.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019690129","display_name":"Kent Quanrud","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kent Quanrud","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5019690129"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06598189,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"1","first_page":"1","last_page":"24"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9876000285148621,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9684000015258789,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7344006896018982},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7055213451385498},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.6869374513626099},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.6096532940864563},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5794963836669922},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5566949844360352},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5168195366859436},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4841052293777466},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4294391870498657},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42358121275901794},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.41293978691101074},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40322327613830566},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3758198916912079},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.24163055419921875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2333221137523651}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7344006896018982},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7055213451385498},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.6869374513626099},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.6096532940864563},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5794963836669922},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5566949844360352},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5168195366859436},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4841052293777466},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4294391870498657},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42358121275901794},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.41293978691101074},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40322327613830566},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3758198916912079},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.24163055419921875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2333221137523651}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2022.v018a007","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2022.v018a007","pdf_url":"https://theoryofcomputing.org/articles/v018a007/v018a007.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2022.v018a007","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2022.v018a007","pdf_url":"https://theoryofcomputing.org/articles/v018a007/v018a007.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G401424543","display_name":null,"funder_award_id":"CCF-1526799","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/W4225947064.pdf","grobid_xml":"https://content.openalex.org/works/W4225947064.grobid-xml"},"referenced_works_count":53,"referenced_works":["https://openalex.org/W1496921672","https://openalex.org/W1519147138","https://openalex.org/W1555221261","https://openalex.org/W1927738121","https://openalex.org/W1964510837","https://openalex.org/W1976432206","https://openalex.org/W1984628625","https://openalex.org/W1990666952","https://openalex.org/W1995027289","https://openalex.org/W1996575062","https://openalex.org/W2001139415","https://openalex.org/W2011999472","https://openalex.org/W2018804864","https://openalex.org/W2019404063","https://openalex.org/W2030460280","https://openalex.org/W2035228443","https://openalex.org/W2042706982","https://openalex.org/W2045430818","https://openalex.org/W2057463094","https://openalex.org/W2058858486","https://openalex.org/W2061006898","https://openalex.org/W2064493067","https://openalex.org/W2079730767","https://openalex.org/W2084990336","https://openalex.org/W2090987888","https://openalex.org/W2091264711","https://openalex.org/W2099463627","https://openalex.org/W2112306992","https://openalex.org/W2121204510","https://openalex.org/W2122205547","https://openalex.org/W2122466336","https://openalex.org/W2125472409","https://openalex.org/W2150865801","https://openalex.org/W2163656645","https://openalex.org/W2167637346","https://openalex.org/W2168919539","https://openalex.org/W2471129545","https://openalex.org/W2741464441","https://openalex.org/W2779121958","https://openalex.org/W2949505842","https://openalex.org/W2953221689","https://openalex.org/W2962940209","https://openalex.org/W2963751092","https://openalex.org/W2964227682","https://openalex.org/W2964273566","https://openalex.org/W2977612001","https://openalex.org/W2998970133","https://openalex.org/W3015233796","https://openalex.org/W3036281379","https://openalex.org/W4226347946","https://openalex.org/W4244924642","https://openalex.org/W4295138284","https://openalex.org/W4295373208"],"related_works":["https://openalex.org/W2141353198","https://openalex.org/W2129497110","https://openalex.org/W1572441411","https://openalex.org/W4289685524","https://openalex.org/W2885987986","https://openalex.org/W2619966450","https://openalex.org/W3208371434","https://openalex.org/W3082232337","https://openalex.org/W2977612001","https://openalex.org/W2096411231"],"abstract_inverted_index":{"In":[0],"an":[1,207],"undirected":[2],"graph,":[3],"a":[4,7,75,90,112,144,187,204],"$k$-cut":[5,24,44,80,117,173,195],"is":[6,34,45,59],"set":[8],"of":[9,38,103,140,156,210,216,223],"edges":[10],"whose":[11],"removal":[12],"breaks":[13],"the":[14,39,42,54,63,97,138,152,179,221,224],"graph":[15],"into":[16],"at":[17],"least":[18],"$k$":[19,33],"connected":[20],"components.":[21],"The":[22,135,159],"minimum-weight":[23,43,79,116],"can":[25,81,118],"be":[26,82,119,174],"computed":[27,83,120,175],"in":[28,122,196,220],"$n^{O(k)}$":[29],"time,":[30,202],"but":[31],"when":[32],"treated":[35],"as":[36,176,178],"part":[37],"input,":[40],"computing":[41],"NP-hard":[46],"[Goldschmidt":[47],"and":[48,70,107],"Hochbaum":[49],"1994].":[50],"For":[51],"poly$({m,n,k})$-time":[52],"algorithms,":[53],"best":[55],"possible":[56],"approximation":[57,189],"factor":[58],"essentially":[60],"2":[61],"under":[62],"Small-Set":[64],"Expansion":[65],"Hypothesis":[66],"[Manurangsi":[67],"2017].":[68],"Saran":[69],"Vazirani":[71],"[1995]":[72],"showed":[73,110],"that":[74,111,191],"$(2":[76,113],"-":[77,114],"2/k)$-approximately":[78,115],"via":[84,96,203],"$O(k)$":[85],"minimum":[86,149,164,168,172,180,194],"cuts,":[87],"which":[88],"implies":[89],"$\\tilde{O}(k":[91,157],"m)$":[92],"randomized":[93,100,153,183],"running":[94,154],"time":[95,155],"nearly":[98],"linear-time":[99],"min-cut":[101],"algorithm":[102,146,190],"Karger":[104],"[2000].":[105],"Nagamochi":[106],"Kamidoi":[108],"[2007]":[109],"deterministically":[121],"$O(mn":[123],"+":[124],"n^2":[125],"\\log":[126],"n)$":[127],"time.":[128],"These":[129],"results":[130],"prompt":[131],"two":[132],"basic":[133],"questions.":[134],"first":[136],"concerns":[137],"role":[139],"randomization.":[141],"Is":[142],"there":[143],"deterministic":[145,188],"for":[147,206,231],"$2$-approximate":[148,171],"$k$-cut,":[150],"matching":[151],"m)$?":[158],"second":[160],"question":[161],"qualitatively":[162],"compares":[163],"cut":[165],"to":[166],"2-approximate":[167],"$k$-cut.":[169,211],"Can":[170],"fast":[177],"cut\u2014in":[181],"$\\tilde{O}(m)$":[182],"time?":[184],"We":[185],"give":[186],"computes":[192],"$(2+\\epsilon)$-approximate":[193],"$O(m":[197],"\\log^3":[198],"n":[199],"/":[200],"\\epsilon^2)$":[201],"$(1+\\epsilon)$-approximation":[205],"LP":[208],"relaxation":[209],"-------------":[212],"An":[213],"extended":[214],"abstract":[215],"this":[217],"paper":[218],"appeared":[219],"Proceedings":[222],"22nd":[225],"International":[226],"Conference":[227],"on":[228],"Approximation":[229],"Algorithms":[230],"Combinatorial":[232],"Optimization":[233],"Problems":[234],"(APPROX'19).":[235]},"counts_by_year":[],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2022-05-05T00:00:00"}