{"id":"https://openalex.org/W3016709189","doi":"https://doi.org/10.1145/3406325.3451020","title":"Distributed weighted min-cut in nearly-optimal time","display_name":"Distributed weighted min-cut in nearly-optimal time","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3016709189","doi":"https://doi.org/10.1145/3406325.3451020","mag":"3016709189"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451020","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451020","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2004.09129","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052412504","display_name":"Michal Dory","orcid":"https://orcid.org/0000-0002-8565-9642"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]},{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH","IL"],"is_corresponding":false,"raw_author_name":"Michal Dory","raw_affiliation_strings":["ETH Zurich, Switzerland","Technion-Israel Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"Technion-Israel Institute of Technology","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061920904","display_name":"Yuval Efron","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Yuval Efron","raw_affiliation_strings":["University of Toronto, Canada","(University of Toronto, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"(University of Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050217636","display_name":"Sagnik Mukhopadhyay","orcid":"https://orcid.org/0000-0002-3722-4679"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Sagnik Mukhopadhyay","raw_affiliation_strings":["KTH, Sweden","Royal Institute of Technology"],"raw_orcid":"https://orcid.org/0000-0002-3722-4679","affiliations":[{"raw_affiliation_string":"KTH, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074369690","display_name":"Danupon Nanongkai","orcid":"https://orcid.org/0000-0003-4468-2675"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]},{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["DK","SE"],"is_corresponding":false,"raw_author_name":"Danupon Nanongkai","raw_affiliation_strings":["University of Copenhagen, Denmark / KTH, Sweden","Royal Institute of Technology"],"raw_orcid":"https://orcid.org/0000-0003-4468-2675","affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark / KTH, Sweden","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":5,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4087,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.41271423,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"1144","last_page":"1153"},"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.9983000159263611,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9933000206947327,"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.6886884570121765},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.6691566705703735},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.6250061392784119},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6066092848777771},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5891615152359009},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5185178518295288},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5066452622413635},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.49540531635284424},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4814585745334625},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.46476420760154724},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4342319071292877},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41724249720573425},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39115291833877563},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29296714067459106}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6886884570121765},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.6691566705703735},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.6250061392784119},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6066092848777771},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5891615152359009},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5185178518295288},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5066452622413635},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.49540531635284424},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4814585745334625},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.46476420760154724},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4342319071292877},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41724249720573425},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39115291833877563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29296714067459106},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/3406325.3451020","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451020","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:200972","is_oa":false,"landing_page_url":"https://eprints.whiterose.ac.uk/200972/1/2004.09129.pdf","pdf_url":"https://eprints.whiterose.ac.uk/200972/1/2004.09129.pdf","source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Proceedings Paper"},{"id":"pmh:oai:arXiv.org:2004.09129","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2004.09129","pdf_url":"https://arxiv.org/pdf/2004.09129","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:3016709189","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/2004.09129","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/de06b6c4-91eb-4a56-9008-1cfd452d2fd4","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/de06b6c4-91eb-4a56-9008-1cfd452d2fd4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Dory , M , Efron , Y , Mukhopadhyay , S & Nanongkai , D 2021 , Distributed weighted min-cut in nearly-optimal time . in S Khuller & V V Williams (eds) , STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing . Association for Computing Machinery, Inc. , pp. 1144-1153 , 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 , Virtual, Online , Italy , 21/06/2021 . https://doi.org/10.1145/3406325.3451020","raw_type":"contributionToPeriodical"},{"id":"doi:10.48550/arxiv.2004.09129","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2004.09129","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2004.09129","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2004.09129","pdf_url":"https://arxiv.org/pdf/2004.09129","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1890725643","display_name":"Distributed Graph Algorithms and Lower Bounds","funder_award_id":"2019-05622","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G1981933775","display_name":"Algorithms and Complexity for Dynamic Graph Problems","funder_award_id":"2015-04659","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G4842944547","display_name":null,"funder_award_id":"715672","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1497938971","https://openalex.org/W1508113861","https://openalex.org/W1534484868","https://openalex.org/W1964510837","https://openalex.org/W1980229659","https://openalex.org/W1984090926","https://openalex.org/W2002531683","https://openalex.org/W2006444174","https://openalex.org/W2015819397","https://openalex.org/W2030825457","https://openalex.org/W2040011014","https://openalex.org/W2101014999","https://openalex.org/W2116055396","https://openalex.org/W2150516767","https://openalex.org/W2153507546","https://openalex.org/W2154501376","https://openalex.org/W2294674552","https://openalex.org/W2467525240","https://openalex.org/W2611854190","https://openalex.org/W2803918337","https://openalex.org/W2810492404","https://openalex.org/W2861707247","https://openalex.org/W2896802580","https://openalex.org/W2949524113","https://openalex.org/W2952490263","https://openalex.org/W2962680238","https://openalex.org/W2963355678","https://openalex.org/W2964713335","https://openalex.org/W2971774981","https://openalex.org/W2983782154","https://openalex.org/W3000941460","https://openalex.org/W3083960872","https://openalex.org/W3102961801","https://openalex.org/W6769798959","https://openalex.org/W6776103432","https://openalex.org/W6785742706"],"related_works":["https://openalex.org/W3102961801","https://openalex.org/W2900102855","https://openalex.org/W2746769191","https://openalex.org/W1497938971","https://openalex.org/W2044814640","https://openalex.org/W2982297668","https://openalex.org/W2949607604","https://openalex.org/W3130215558","https://openalex.org/W3015309785","https://openalex.org/W2938795088","https://openalex.org/W3208037711","https://openalex.org/W2620124033","https://openalex.org/W2971430063","https://openalex.org/W3100139999","https://openalex.org/W3034552259","https://openalex.org/W3208371434","https://openalex.org/W2949396974","https://openalex.org/W2952103668","https://openalex.org/W2965947731","https://openalex.org/W3170339516"],"abstract_inverted_index":{"Minimum-weight":[0],"cut":[1,186],"(min-cut)":[2],"is":[3,71],"a":[4,8,31,68,173,184,188],"basic":[5],"measure":[6],"of":[7,105,169,183,187,200,206],"network\u2019s":[9,103],"connectivity":[10],"strength.":[11],"While":[12],"the":[13,20,41,46,50,76,102,111,114,145,158,167,181,198],"min-cut":[14,38,137],"can":[15,66,204],"be":[16,205],"computed":[17],"efficiently":[18],"in":[19],"sequential":[21],"setting":[22],"[Karger":[23],"STOC\u201996],":[24],"there":[25],"was":[26,117],"no":[27,94],"efficient":[28],"way":[29],"for":[30,135],"distributed":[32],"network":[33],"to":[34,163],"compute":[35],"its":[36],"own":[37],"without":[39],"limiting":[40],"input":[42],"structure":[43,182],"or":[44],"dropping":[45],"output":[47],"quality:":[48],"In":[49,124],"standard":[51],"CONGEST":[52],"model,":[53],"existing":[54],"algorithms":[55],"with":[56],"nearly-optimal":[57],"time":[58,155],"(e.g.":[59],"[Ghaffari,":[60,82],"Kuhn,":[61],"DISC\u201913;":[62],"Nanongkai,":[63,121],"Su,":[64],"DISC\u201914])":[65],"guarantee":[67],"solution":[69],"that":[70,148],"(1+\u0454)-approximation":[72],"at":[73],"best":[74,115],"while":[75],"exact":[77,130],"\u00d5(n0.8D0.2":[78],"+":[79,132],"n0.9)-time":[80],"algorithm":[81,134,147,171],"Nowicki,":[83],"Thorup,":[84],"SODA\u201920]":[85],"works":[86,149],"only":[87,150],"on":[88,138,151],"simple":[89,152],"networks":[90],"(no":[91],"weights":[92],"and":[93,99,107,176,196,203],"parallel":[95],"edges).":[96],"Throughout,":[97],"n":[98],"D":[100],"denote":[101],"number":[104],"vertices":[106],"hop-diameter,":[108],"respectively.":[109],"For":[110],"weighted":[112,139],"case,":[113],"bound":[116,161],"\u00d5(n)":[118],"[Daga,":[119],"Henzinger,":[120],"Saranurak,":[122],"STOC\u201919].":[123],"this":[125],"paper,":[126],"we":[127],"provide":[128],"an":[129],"\u00d5(\u221an":[131],"D)-time":[133],"computing":[136],"networks.":[140,153],"Our":[141],"result":[142],"improves":[143],"even":[144],"previous":[146],"Its":[154],"complexity":[156],"matches":[157],"known":[159],"lower":[160],"up":[162],"polylogarithmic":[164],"factors.":[165],"At":[166],"heart":[168],"our":[170],"are":[172],"routing":[174],"trick":[175],"two":[177,191],"structural":[178,192],"lemmas":[179,193],"regarding":[180],"minimum":[185],"graph.":[189],"These":[190],"considerably":[194],"strengthen":[195],"generalize":[197],"framework":[199],"Mukhopadhyay-Nanongkai":[201],"[STOC\u201920]":[202],"independent":[207],"interest.":[208]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}