{"id":"https://openalex.org/W4416932870","doi":"https://doi.org/10.1145/3798129.3800862","title":"Approximating Directed Connectivity in Almost-Linear Time","display_name":"Approximating Directed Connectivity in Almost-Linear Time","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4416932870","doi":"https://doi.org/10.1145/3798129.3800862"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800862","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3798129.3800862","pdf_url":null,"source":null,"license":null,"license_id":null,"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":"green","oa_url":"https://arxiv.org/pdf/2512.00176","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019690129","display_name":"Kent Quanrud","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kent Quanrud","raw_affiliation_strings":["Purdue University, Computer Science, West Lafayette, USA"],"raw_orcid":"https://orcid.org/0009-0004-5488-2907","affiliations":[{"raw_affiliation_string":"Purdue University, Computer Science, West Lafayette, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5019690129"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03076698,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1540","last_page":"1547"},"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.8895999789237976,"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.8895999789237976,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.03999999910593033,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.00930000003427267,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6061000227928162},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.40689998865127563},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.3587000072002411},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.3513999879360199},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.35089999437332153},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3490000069141388},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.3458999991416931},{"id":"https://openalex.org/keywords/sink","display_name":"Sink (geography)","score":0.33629998564720154}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6061000227928162},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5508999824523926},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4878999888896942},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.40689998865127563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3894999921321869},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.383899986743927},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.3587000072002411},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.3513999879360199},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.35089999437332153},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3490000069141388},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3458999991416931},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33809998631477356},{"id":"https://openalex.org/C143050476","wikidata":"https://www.wikidata.org/wiki/Q194502","display_name":"Sink (geography)","level":2,"score":0.33629998564720154},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3248000144958496},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.32359999418258667},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3212999999523163},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.31839999556541443},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.3172000050544739},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.3100000023841858},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3057999908924103},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.30480000376701355},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.3018999993801117},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.2599000036716461}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800862","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3798129.3800862","pdf_url":null,"source":null,"license":null,"license_id":null,"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.00176","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.00176","pdf_url":"https://arxiv.org/pdf/2512.00176","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.00176","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.00176","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":"pmh:oai:arXiv.org:2512.00176","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.00176","pdf_url":"https://arxiv.org/pdf/2512.00176","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1807682599","display_name":null,"funder_award_id":"CCF-2129816","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"present":[1],"randomized":[2],"algorithms":[3,55,65],"that":[4],"compute":[5,163],"$(1+\u03b5)$-approximate":[6],"minimum":[7,128,166],"global":[8],"edge":[9,42],"and":[10,21,43,86,107,135,162],"vertex":[11,44,58],"cuts":[12],"in":[13,17,168],"weighted":[14],"directed":[15],"graphs":[16],"$O(\\log^4(n)":[18],"/":[19],"\u03b5)$":[20],"$O(\\log^5(n)/\u03b5)$":[22],"single-commodity":[23],"flows,":[24],"respectively.":[25],"With":[26],"the":[27,61,96,105,109,117,123,127,141,152,158],"almost-linear":[28],"time":[29,38],"flow":[30,93],"algorithm":[31],"of":[32,63,89,104,126,143,160],"[CKL+22],":[33],"this":[34,50],"gives":[35,52],"almost":[36],"linear":[37],"approximation":[39],"schemes":[40],"for":[41,56,72,82,108,130],"connectivity.":[45,59],"By":[46],"setting":[47],"$\u03b5$":[48],"appropriately,":[49],"also":[51],"faster":[53],"exact":[54],"small":[57],"At":[60],"heart":[62],"these":[64],"is":[66],"a":[67,73,83,87,99,148],"divide-and-conquer":[68,149],"technique":[69],"called":[70],"\"shrink-wrapping\"":[71],"certain":[74],"well-conditioned":[75],"rooted":[76],"Steiner":[77],"connectivity":[78,97],"problem.":[79],"Loosely":[80],"speaking,":[81],"root":[84,100],"$r$":[85,101],"set":[88,159],"terminals,":[90,106,112],"shrink-wrapping":[91],"uses":[92],"to":[94,102,140],"certify":[95],"from":[98],"some":[103],"remaining":[110],"uncertified":[111,132,144],"generates":[113],"an":[114],"$r$-cut":[115],"where":[116,154],"sink":[118,124],"component":[119,125],"both":[120],"(a)":[121],"contains":[122],"$(r,t)$-cut":[129],"each":[131],"terminal":[133],"$t$":[134],"(b)":[136],"has":[137],"size":[138],"proportional":[139],"number":[142],"terminals.":[145],"This":[146],"yields":[147],"scheme":[150],"over":[151],"terminals":[153,161],"we":[155],"can":[156],"divide":[157],"their":[164],"respective":[165],"$r$-cuts":[167],"smaller,":[169],"contracted":[170],"subgraphs.":[171]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-12-03T00:00:00"}