{"id":"https://openalex.org/W4396892911","doi":"https://doi.org/10.1145/3651148","title":"Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut","display_name":"Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut","publication_year":2024,"publication_date":"2024-05-10","ids":{"openalex":"https://openalex.org/W4396892911","doi":"https://doi.org/10.1145/3651148","pmid":"https://pubmed.ncbi.nlm.nih.gov/39569053"},"language":"en","primary_location":{"id":"doi:10.1145/3651148","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3651148","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3651148","source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3651148","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026746295","display_name":"Yu Cheng","orcid":"https://orcid.org/0000-0002-0019-2570"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yu Cheng","raw_affiliation_strings":["Brown University, Providence, RI, USA"],"raw_orcid":"https://orcid.org/0000-0002-0019-2570","affiliations":[{"raw_affiliation_string":"Brown University, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102857443","display_name":"Max Li","orcid":"https://orcid.org/0009-0001-0659-7739"},"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":"Max Li","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0009-0001-0659-7739","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004582871","display_name":"Honghao Lin","orcid":"https://orcid.org/0009-0004-5162-3328"},"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":"Honghao Lin","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0009-0004-5162-3328","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5098402080","display_name":"Zi-Yi Tai","orcid":"https://orcid.org/0009-0007-9399-8605"},"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":"Zi-Yi Tai","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0009-0007-9399-8605","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102861589","display_name":"David P. Woodruff","orcid":"https://orcid.org/0000-0002-2158-1380"},"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":"David P. Woodruff","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0002-2158-1380","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074856963","display_name":"Jason Zhang","orcid":"https://orcid.org/0009-0000-7441-2583"},"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 Zhang","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0009-0000-7441-2583","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08179305,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":"2","first_page":"1","last_page":"18"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9970999956130981,"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.9937999844551086,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7173503637313843},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6951203942298889},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6914474964141846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6653120517730713},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6606978178024292},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5634429454803467},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4874916076660156},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4722920060157776},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45511913299560547},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42976099252700806},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16137433052062988}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7173503637313843},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6951203942298889},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6914474964141846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6653120517730713},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6606978178024292},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5634429454803467},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4874916076660156},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4722920060157776},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45511913299560547},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42976099252700806},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16137433052062988},{"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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3651148","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3651148","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3651148","source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},{"id":"pmid:39569053","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/39569053","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on management of data","raw_type":null},{"id":"pmh:oai:pubmedcentral.nih.gov:11576265","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/11576265","pdf_url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC11576265/pdf/nihms-2027450.pdf","source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proc ACM Manag Data","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1145/3651148","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3651148","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3651148","source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4841703938","display_name":null,"funder_award_id":"5R01 HG 10798-2","funder_id":"https://openalex.org/F4320332161","funder_display_name":"National Institutes of Health"},{"id":"https://openalex.org/G5566036973","display_name":null,"funder_award_id":"R01 HG010798","funder_id":"https://openalex.org/F4320337348","funder_display_name":"National Human Genome Research Institute"},{"id":"https://openalex.org/G6203413088","display_name":"AF: Small: Faster Algorithms for High-Dimensional Robust Statistics","funder_award_id":"2307106","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"},{"id":"https://openalex.org/F4320332161","display_name":"National Institutes of Health","ror":"https://ror.org/01cwqze88"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null},{"id":"https://openalex.org/F4320337348","display_name":"National Human Genome Research Institute","ror":"https://ror.org/00baak391"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4396892911.pdf"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1977601838","https://openalex.org/W1983193888","https://openalex.org/W1997010704","https://openalex.org/W2002894241","https://openalex.org/W2016289973","https://openalex.org/W2045107949","https://openalex.org/W2067081844","https://openalex.org/W2129575457","https://openalex.org/W2176494464","https://openalex.org/W2319135850","https://openalex.org/W2594480752","https://openalex.org/W2780845556","https://openalex.org/W2902172596","https://openalex.org/W2958706771","https://openalex.org/W4239751253","https://openalex.org/W6645866653"],"related_works":["https://openalex.org/W2186707160","https://openalex.org/W1974018476","https://openalex.org/W2903538031","https://openalex.org/W2129497110","https://openalex.org/W1983915440","https://openalex.org/W2141353198","https://openalex.org/W2115772827","https://openalex.org/W2942946217","https://openalex.org/W2078695342","https://openalex.org/W1588356204"],"abstract_inverted_index":{"In":[0,38,255],"this":[1,39,227],"paper,":[2],"we":[3,41,159,203,251,257],"consider":[4,115],"two":[5],"fundamental":[6],"cut":[7,55,126,196,248],"approximation":[8],"problems":[9,20],"on":[10,57],"large":[11],"graphs.":[12,37],"We":[13,114,141,215],"prove":[14,216],"new":[15],"lower":[16,147,165,224,235,268],"bounds":[17,262],"for":[18,77,90,226],"both":[19],"that":[21,48,89,259],"are":[22],"optimal":[23],"up":[24,270],"to":[25,43,123,153,171,271],"logarithmic":[26,272],"factors.":[27,273],"The":[28,188],"first":[29],"problem":[30,190],"is":[31,102,122,191,239,245],"approximating":[32,192],"cuts":[33,136],"in":[34,99,110,149,167,197],"balanced":[35],"directed":[36,65,92],"problem,":[40,228],"want":[42],"build":[44],"a":[45,58,68,198,253],"data":[46,69],"structure":[47,70],"can":[49,204],"provide":[50],"(1":[51],"\u00b1":[52],"\u03b5)-approximation":[53],"of":[54,97,182,242],"values":[56],"graph":[59,208],"with":[60,127,263],"n":[61],"vertices.":[62],"For":[63],"arbitrary":[64],"graphs,":[66,87],"such":[67],"requires":[71],"\u03a9(n":[72,163,172],"2":[73,174,221],")":[74],"bits":[75],"even":[76],"constant":[78,128],"\u03b5.":[79],"To":[80],"circumvent":[81],"this,":[82],"recent":[83],"works":[84],"study":[85],"\u03b2-balanced":[86],"meaning":[88],"every":[91],"cut,":[93],"the":[94,107,111,116,120,131,143,150,161,168,178,193,207,231,240,246],"total":[95,108],"weight":[96,109],"edges":[98],"one":[100],"direction":[101],"at":[103],"most":[104],"\u03b2":[105],"times":[106],"other":[112],"direction.":[113],"for-each":[117,151],"model,":[118,133,201],"where":[119,134,202,237],"goal":[121],"approximate":[124],"each":[125],"probability,":[129],"and":[130,158,212,250],"for-all":[132,169],"all":[135],"must":[137],"be":[138],"preserved":[139],"simultaneously.":[140],"improve":[142,160],"previous":[144,162,232],"\u00d8mega(n":[145],"\u221a\u03b2/\u03b5)":[146],"bound":[148,166,225,269],"model":[152,170],"~\u03a9":[154],"(n":[155],"\u221a\u03b2":[156],"/\u03b5)":[157],"\u03b2/\u03b5)":[164],"\u03b2/\u03b5":[173],").":[175],"This":[176],"resolves":[177],"main":[179],"open":[180],"questions":[181],"(Cen":[183],"et":[184],"al.,":[185],"ICALP,":[186],"2021).":[187],"second":[189],"global":[194],"minimum":[195,247],"local":[199],"query":[200],"only":[205],"access":[206],"via":[209],"degree,":[210],"edge,":[211],"adjacency":[213],"queries.":[214],"an":[217],"\u03a9L(min":[218],"m,":[219],"m/\u03b5":[220],"k":[222,244],"R)":[223,234],"which":[229],"improves":[230],"\u03a9L(m/k":[233],"bound,":[236],"m":[238],"number":[241],"edges,":[243],"size,":[249],"seek":[252],"(1+\u03b5)-approximation.":[254],"addition,":[256],"show":[258],"existing":[260],"upper":[261],"minor":[264],"modifications":[265],"match":[266],"our":[267]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}