{"id":"https://openalex.org/W4417289389","doi":"https://doi.org/10.1145/3798129.3800732","title":"Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs","display_name":"Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4417289389","doi":"https://doi.org/10.1145/3798129.3800732"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800732","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800732","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800732","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063639713","display_name":"Ron Mosenzon","orcid":null},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ron Mosenzon","raw_affiliation_strings":["Toyota Technological Institute at Chicago, Chicago, USA"],"raw_orcid":"https://orcid.org/0009-0006-7775-0653","affiliations":[{"raw_affiliation_string":"Toyota Technological Institute at Chicago, Chicago, USA","institution_ids":["https://openalex.org/I160992636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063639713"],"corresponding_institution_ids":["https://openalex.org/I160992636"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03213223,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"106","last_page":"117"},"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.9247000217437744,"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.9247000217437744,"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.024800000712275505,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.01940000057220459,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.6823999881744385},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5681999921798706},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5300999879837036},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5263000130653381},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5076000094413757},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4575999975204468},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45509999990463257},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.45329999923706055},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.3772999942302704}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6861000061035156},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.6823999881744385},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5681999921798706},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5300999879837036},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5263000130653381},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5076000094413757},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47999998927116394},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4772000014781952},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4575999975204468},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45509999990463257},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.45329999923706055},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3772999942302704},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.3698999881744385},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3537999987602234},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.33709999918937683},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.33640000224113464},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32839998602867126},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.32440000772476196},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32359999418258667},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.2833000123500824},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2831000089645386},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.2827000021934509},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.2808000147342682},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.2766000032424927},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.2635999917984009},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.257099986076355},{"id":"https://openalex.org/C11577676","wikidata":"https://www.wikidata.org/wiki/Q134237","display_name":"Square root","level":2,"score":0.2565999925136566}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800732","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800732","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2512.09080","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.09080","pdf_url":"https://arxiv.org/pdf/2512.09080","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"doi:10.48550/arxiv.2512.09080","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.09080","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800732","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800732","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4004885199","display_name":null,"funder_award_id":"CCF-2402283","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"develop":[1],"new":[2],"(1+\u0454)-approximation":[3],"algorithms":[4,29,58],"for":[5,17,53,71,83,88],"finding":[6,18],"the":[7,19],"global":[8,20],"minimum":[9,21],"edge-cut":[10],"in":[11,23],"a":[12,24,34],"directed":[13,25],"edge-weighted":[14],"graph,":[15,44],"and":[16,32,86],"vertex-cut":[22],"vertex-weighted":[26],"graph.":[27],"Our":[28],"are":[30,49],"randomized,":[31],"have":[33,59],"running":[35,62,69],"time":[36,63,70],"of":[37,64],"O(m1+o(1)/\u0454)":[38],"on":[39],"any":[40,54],"m-edge":[41],"n-vertex":[42],"input":[43],"assuming":[45],"all":[46],"edge/vertex":[47],"weights":[48],"polynomially-bounded.":[50],"In":[51],"particular,":[52],"constant":[55],"\u0454>0,":[56],"our":[57],"an":[60],"almost-optimal":[61],"O(m1+o(1)).":[65],"The":[66],"fastest":[67],"previously-known":[68],"this":[72],"setting,":[73],"due":[74],"to":[75],"(Cen":[76],"et":[77],"al.,":[78],"FOCS":[79],"2021),":[80],"is":[81],"O(min{n2/\u04542,m1+o(1)\u221an})":[82],"Minimum":[84,89],"Edge-Cut,":[85],"O(n2/\u04542)":[87],"Vertex-Cut.":[90]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-12-12T00:00:00"}