{"id":"https://openalex.org/W4376651378","doi":"https://doi.org/10.1145/3564246.3585135","title":"Dynamic Maxflow via Dynamic Interior Point Methods","display_name":"Dynamic Maxflow via Dynamic Interior Point Methods","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376651378","doi":"https://doi.org/10.1145/3564246.3585135"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585135","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585135","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585135","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585135","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054956160","display_name":"Jan van den Brand","orcid":"https://orcid.org/0000-0001-8611-6896"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jan van den Brand","raw_affiliation_strings":["Georgia Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063729451","display_name":"Yang P. Liu","orcid":"https://orcid.org/0000-0001-6717-0539"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang P. Liu","raw_affiliation_strings":["Stanford University, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086787265","display_name":"Aaron Sidford","orcid":"https://orcid.org/0000-0003-2675-7610"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aaron Sidford","raw_affiliation_strings":["Stanford University, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054956160"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":0.9748,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.78562183,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1215","last_page":"1228"},"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.9995999932289124,"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.9995999932289124,"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/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.9945999979972839,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6764045357704163},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6057885885238647},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.5108992457389832},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5045884847640991},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4994523525238037},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4964445233345032},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.479581743478775},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.47088155150413513},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.46000176668167114},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.4415542483329773},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4342042803764343},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41531309485435486},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35347485542297363},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3444901704788208},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.23397991061210632}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6764045357704163},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6057885885238647},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.5108992457389832},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5045884847640991},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4994523525238037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4964445233345032},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.479581743478775},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.47088155150413513},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.46000176668167114},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4415542483329773},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4342042803764343},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41531309485435486},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35347485542297363},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3444901704788208},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.23397991061210632},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585135","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585135","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585135","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3564246.3585135","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585135","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585135","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1171700966","display_name":null,"funder_award_id":"NSF CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2893785016","display_name":"CAREER: Theory of Fast Graph Optimization","funder_award_id":"1844855","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3318838114","display_name":null,"funder_award_id":"CCF-1955039","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3631313543","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320308943","funder_display_name":"Microsoft Research"},{"id":"https://openalex.org/G5727344453","display_name":null,"funder_award_id":"CCF-1844855","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6507447573","display_name":null,"funder_award_id":"several","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7994237705","display_name":"Collaborative Research: AF: Medium: Foundations of Structured Optimization","funder_award_id":"1955039","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8916045616","display_name":null,"funder_award_id":"CCF-1844855, CCF-1955039","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/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4376651378.pdf","grobid_xml":"https://content.openalex.org/works/W4376651378.grobid-xml"},"referenced_works_count":55,"referenced_works":["https://openalex.org/W1545030848","https://openalex.org/W1963524245","https://openalex.org/W1983248819","https://openalex.org/W1992869351","https://openalex.org/W2009695707","https://openalex.org/W2010151376","https://openalex.org/W2031592993","https://openalex.org/W2045430818","https://openalex.org/W2051294918","https://openalex.org/W2099463627","https://openalex.org/W2106759055","https://openalex.org/W2121473031","https://openalex.org/W2122205547","https://openalex.org/W2128744826","https://openalex.org/W2133352257","https://openalex.org/W2133521834","https://openalex.org/W2153715991","https://openalex.org/W2158560363","https://openalex.org/W2169528477","https://openalex.org/W2178621981","https://openalex.org/W2278710066","https://openalex.org/W2341465683","https://openalex.org/W2565540516","https://openalex.org/W2571471359","https://openalex.org/W2810725631","https://openalex.org/W2949824190","https://openalex.org/W2971415725","https://openalex.org/W2972220082","https://openalex.org/W2972259791","https://openalex.org/W2974337481","https://openalex.org/W3020969699","https://openalex.org/W3034936862","https://openalex.org/W3035470141","https://openalex.org/W3117596577","https://openalex.org/W3118483938","https://openalex.org/W3126680358","https://openalex.org/W3126916987","https://openalex.org/W3129012052","https://openalex.org/W3129191225","https://openalex.org/W3202772786","https://openalex.org/W4210896998","https://openalex.org/W4214889729","https://openalex.org/W4225852864","https://openalex.org/W4235789583","https://openalex.org/W4286853891","https://openalex.org/W4286896592","https://openalex.org/W4288091431","https://openalex.org/W4289422050","https://openalex.org/W4299036670","https://openalex.org/W4299817332","https://openalex.org/W4299908908","https://openalex.org/W4300030091","https://openalex.org/W4301624506","https://openalex.org/W4316652388","https://openalex.org/W4367322281"],"related_works":["https://openalex.org/W3161514703","https://openalex.org/W3035974271","https://openalex.org/W2625547693","https://openalex.org/W1994440468","https://openalex.org/W2098682899","https://openalex.org/W3141113327","https://openalex.org/W2182648737","https://openalex.org/W2590727506","https://openalex.org/W4206915070","https://openalex.org/W2051329268"],"abstract_inverted_index":{"In":[0],"this":[1,48,108],"paper":[2],"we":[3,50,106],"provide":[4],"an":[5,28,94,126,149,171],"algorithm":[6,38,153],"for":[7,55,83,154,165],"maintaining":[8,166],"a":[9,14,22,71,84,89,160],"(1\u2212\u0454)-approximate":[10],"maximum":[11],"flow":[12,112],"in":[13,40,70,114,170],"dynamic,":[15],"capacitated":[16],"graph":[17,30,73,96,173],"undergoing":[18,74],"edge":[19,33,75,99],"insertions.":[20],"Over":[21,88],"sequence":[23,90],"of":[24,60,65,118],"m":[25,91],"insertions":[26,76,92],"to":[27,93,147],"n-node":[29,95],"where":[31,97],"every":[32,98],"has":[34,100],"capacity":[35,101],"O(poly(m))":[36,102,105],"our":[37,119],"runs":[39],"time":[41,152],"O(m":[42,115],"\u221an":[43],"\u00b7":[44],"\u0454\u22121).":[45],"To":[46],"obtain":[47,130,148],"result":[49],"design":[51],"dynamic":[52,72,162],"data":[53,163],"structures":[54],"the":[56,63,66,135],"more":[57],"general":[58],"problem":[59,113],"detecting":[61],"when":[62],"value":[64,78],"minimum":[67,110,155,167],"cost":[68,104,111,156],"circulation":[69],"achieves":[77],"at":[79],"most":[80],"F":[81],"(exactly)":[82],"given":[85],"threshold":[86],"F.":[87],"and":[103,158],"solve":[107],"thresholded":[109],"\u221an).":[116],"Both":[117],"algorithms":[120],"succeed":[121],"with":[122,176],"high":[123,177],"probability":[124,178],"against":[125,179],"adaptive":[127,180],"adversary.":[128],"We":[129],"these":[131],"results":[132],"by":[133,140],"dynamizing":[134],"recent":[136],"interior":[137],"point":[138],"method":[139],"[Chen":[141],"et":[142],"al.":[143],"\u200dFOCS":[144],"2022]":[145],"used":[146],"almost":[150],"linear":[151],"flow,":[157],"introducing":[159],"new":[161],"structure":[164],"ratio":[168],"cycles":[169],"undirected":[172],"that":[174],"succeeds":[175],"adversaries.":[181]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-18T07:56:08.524223","created_date":"2025-10-10T00:00:00"}