{"id":"https://openalex.org/W4416425876","doi":"https://doi.org/10.1145/3798129.3800836","title":"Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow","display_name":"Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4416425876","doi":"https://doi.org/10.1145/3798129.3800836"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800836","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800836","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":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800836","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119918554","display_name":"Yotam Kenneth-Mordoch","orcid":null},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yotam Kenneth-Mordoch","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"raw_orcid":"https://orcid.org/0000-0002-9212-9172","affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037378898","display_name":"Robert Krauthgamer","orcid":"https://orcid.org/0009-0003-8154-3735"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Robert Krauthgamer","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"raw_orcid":"https://orcid.org/0009-0003-8154-3735","affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]}],"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.02935297,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1254","last_page":"1265"},"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.911899983882904,"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.911899983882904,"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.03310000151395798,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.009700000286102295,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/reduction","display_name":"Reduction (mathematics)","score":0.48019999265670776},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46140000224113464},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.3871999979019165},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.34850001335144043},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.3474999964237213},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.33880001306533813},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.32910001277923584},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.3095000088214874}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6068999767303467},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5408999919891357},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.48019999265670776},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46140000224113464},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.3871999979019165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3831999897956848},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.34850001335144043},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.3474999964237213},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.33880001306533813},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3328000009059906},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.32910001277923584},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3165000081062317},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3095000088214874},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.30660000443458557},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.30079999566078186},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2745000123977661},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.26820001006126404},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.2621000111103058},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25450000166893005}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800836","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800836","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:2511.10036","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.10036","pdf_url":"https://arxiv.org/pdf/2511.10036","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2511.10036","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.10036","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.3800836","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800836","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"All-Pairs":[0],"Minimum":[1],"Cut":[2],"(APMC)":[3],"is":[4],"a":[5,13,35],"fundamental":[6],"graph":[7],"problem":[8],"that":[9],"asks":[10],"to":[11,39],"find":[12],"minimum":[14],"s,t-cut":[15],"for":[16,30,51],"every":[17],"pair":[18],"of":[19,25,37,58],"vertices":[20],"s,t.":[21],"A":[22],"recent":[23],"line":[24],"work":[26],"on":[27],"fast":[28,46],"algorithms":[29,47],"APMC":[31,38],"has":[32],"culminated":[33],"with":[34],"reduction":[36],"polylog(n)-many":[40],"max-flow":[41,53],"computations.":[42],"But":[43],"unfortunately,":[44],"no":[45],"are":[48],"currently":[49],"known":[50],"exact":[52],"in":[54],"several":[55],"standard":[56],"models":[57],"computation,":[59],"such":[60],"as":[61],"the":[62,66],"cut-query":[63],"model":[64],"and":[65],"fully-dynamic":[67],"model.":[68]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-15T00:00:00"}