{"id":"https://openalex.org/W2044814640","doi":"https://doi.org/10.1145/2612669.2612706","title":"A distributed minimum cut approximation scheme","display_name":"A distributed minimum cut approximation scheme","publication_year":2014,"publication_date":"2014-06-21","ids":{"openalex":"https://openalex.org/W2044814640","doi":"https://doi.org/10.1145/2612669.2612706","mag":"2044814640"},"language":"en","primary_location":{"id":"doi:10.1145/2612669.2612706","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005437771","display_name":"Hsin-Hao Su","orcid":"https://orcid.org/0009-0002-7970-9604"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hsin-Hao Su","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005437771"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":1.8279,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.85350782,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"217","last_page":"219"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/distributed-algorithm","display_name":"Distributed algorithm","score":0.6171976923942566},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6118830442428589},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5697124004364014},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5515902042388916},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5376637578010559},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5158799886703491},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5116553902626038},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47932493686676025},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4544106721878052},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3822063207626343},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3446790874004364},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34446391463279724},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.1834111511707306}],"concepts":[{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.6171976923942566},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6118830442428589},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5697124004364014},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5515902042388916},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5376637578010559},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5158799886703491},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5116553902626038},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47932493686676025},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4544106721878052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3822063207626343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3446790874004364},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34446391463279724},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1834111511707306},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2612669.2612706","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.754.5076","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.754.5076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1401.5316.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1497938971","https://openalex.org/W1927738121","https://openalex.org/W1964510837","https://openalex.org/W1971680255","https://openalex.org/W1975832752","https://openalex.org/W1981519953","https://openalex.org/W2005900781","https://openalex.org/W2009339416","https://openalex.org/W2012287357","https://openalex.org/W2026268625","https://openalex.org/W2035228443","https://openalex.org/W2057463094","https://openalex.org/W2068888615","https://openalex.org/W2083323175","https://openalex.org/W2151757686","https://openalex.org/W2611854190","https://openalex.org/W2949848588","https://openalex.org/W4247278211","https://openalex.org/W6661865082"],"related_works":["https://openalex.org/W1983915440","https://openalex.org/W3095925971","https://openalex.org/W2036758175","https://openalex.org/W2123112061","https://openalex.org/W3046990805","https://openalex.org/W4287691960","https://openalex.org/W1994598067","https://openalex.org/W2899261484","https://openalex.org/W2137594557","https://openalex.org/W2902010279"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"study":[4],"the":[5,9,17,28,41,45,80,83,88],"problem":[6,23],"of":[7,30,48,59,82,119],"approximating":[8],"minimum":[10,21,84],"cut":[11,22,118],"in":[12,27,40,66,124],"a":[13,95,111,117],"distributed":[14,42,112],"message-passing":[15],"model,":[16],"CONGEST":[18],"model.":[19],"The":[20],"has":[24],"been":[25],"well-studied":[26],"context":[29],"centralized":[31],"algorithms.":[32],"However,":[33],"there":[34],"were":[35],"no":[36,99],"known":[37],"non-trivial":[38],"algorithms":[39,55],"model":[43],"until":[44],"recent":[46],"work":[47],"Ghaffari":[49],"and":[50,62,71],"Kuhn.":[51],"They":[52],"gave":[53],"randomized":[54,113],"for":[56],"finding":[57],"cuts":[58],"size":[60,81,120],"O(\u03b5-1\u03bb)":[61],"(2":[63],"+":[64,68,73,104,122,126],"\u03b5)\u03bb":[65,123],"O(D)":[67],"\u00d5(n1/2+\u03b5)":[69],"rounds":[70,75],"\u00d5(D":[72,125],"\u221an)":[74,127],"respectively,":[76],"where":[77],"\u03bb":[78],"is":[79,107,130],"cut.":[85],"This":[86],"matches":[87],"lower":[89],"bound":[90],"they":[91],"provided":[92],"up":[93,132],"to":[94,133],"polylogarithmic":[96,134],"factor.":[97],"Yet,":[98],"scheme":[100],"that":[101,115],"achieves":[102],"(1":[103,121],"\u03b5)-approximation":[105],"ratio":[106],"known.":[108],"We":[109],"give":[110],"algorithm":[114],"finds":[116],"time,":[128],"which":[129],"optimal":[131],"factors.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2014,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}