{"id":"https://openalex.org/W7165766114","doi":"https://doi.org/10.4230/lipics.sand.2026.23","title":"Brief Announcement: A Special Case of Maximum Flow over Time with Network Changes","display_name":"Brief Announcement: A Special Case of Maximum Flow over Time with Network Changes","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7165766114","doi":"https://doi.org/10.4230/lipics.sand.2026.23"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26257","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.23","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.23/LIPIcs.SAND.2026.23.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.23/LIPIcs.SAND.2026.23.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005407267","display_name":"Shuchi Chawla","orcid":"https://orcid.org/0000-0001-5583-2320"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chawla, Shuchi","raw_affiliation_strings":["Department of Computer Science, University of Texas, Austin, TX, USA"],"raw_orcid":"https://orcid.org/0000-0001-5583-2320","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078264565","display_name":"Kristin Sheridan","orcid":"https://orcid.org/0000-0002-5524-3259"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sheridan, Kristin","raw_affiliation_strings":["Department of Computer Science, University of Texas, Austin, TX, USA"],"raw_orcid":"https://orcid.org/0000-0002-5524-3259","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.66157478,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.8098999857902527,"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.8098999857902527,"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.030700000002980232,"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.02979999966919422,"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/maximum-flow-problem","display_name":"Maximum flow problem","score":0.8616999983787537},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6610000133514404},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5479999780654907},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5023999810218811},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4885999858379364},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.47760000824928284},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.46880000829696655},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4271000027656555},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.38499999046325684}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.8616999983787537},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6657000184059143},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6610000133514404},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5479999780654907},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5023999810218811},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4885999858379364},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.47760000824928284},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.46880000829696655},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.448199987411499},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4271000027656555},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40610000491142273},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.38499999046325684},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.37940001487731934},{"id":"https://openalex.org/C133824558","wikidata":"https://www.wikidata.org/wiki/Q16893660","display_name":"Out-of-kilter algorithm","level":5,"score":0.3772999942302704},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35530000925064087},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3513999879360199},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.3402999937534332},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3393999934196472},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33250001072883606},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.3077999949455261},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.298799991607666},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2888999879360199},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C138236772","wikidata":"https://www.wikidata.org/wiki/Q25098575","display_name":"Edge device","level":3,"score":0.258899986743927},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26257","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.23","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.23/LIPIcs.SAND.2026.23.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.sand.2026.23","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sand.2026.23","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26257","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.23","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.23/LIPIcs.SAND.2026.23.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1271089749","display_name":"AF: Small: New Directions for Simplicity versus Optimality in Mechanism Design","funder_award_id":"2225259","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5331764568","display_name":"Collaborative Research: EnCORE: Institute for Emerging CORE Methods in Data Science","funder_award_id":"2217069","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":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7165766114.pdf","grobid_xml":"https://content.openalex.org/works/W7165766114.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,28,106],"consider":[1],"the":[2,6,22,31,37,46,53,59,94,97,103,133,142,159,172,181],"problem":[3,134],"of":[4,8,33,49,56,78,147,161,175],"finding":[5],"value":[7,92],"a":[9,15,40,75,79,86,109,121],"maximum":[10,173],"flow":[11,91,99,145],"over":[12,26,100],"time":[13,48,101,140,157,182],"in":[14,36,58,71,138,152],"network":[16,38],"with":[17,111,123],"uniform":[18],"edge":[19,23,35,177],"lengths":[20],"where":[21,169],"capacities":[24],"change":[25],"time.":[27],"assume":[29],"that":[30,108,132],"capacity":[32,60,118,174],"every":[34],"is":[39,74,93,171,180,189],"piecewise":[41],"constant":[42],"function":[43],"and":[44,116,126,178],"parameterize":[45],"running":[47],"our":[50,72],"algorithm":[51,146,160],"by":[52],"total":[54],"number":[55],"pieces":[57],"functions":[61],"across":[62],"all":[63],"edges,":[64,115],"denoted":[65],"\u03bc.":[66],"The":[67],"key":[68],"technical":[69],"component":[70],"approach":[73],"condensed":[76],"version":[77],"Time":[80],"Expanded":[81],"Network":[82],"(that":[83],"we":[84],"call":[85],"cTEN)":[87],"whose":[88],"classical":[89],"max":[90,98,144],"same":[95],"as":[96],"on":[102],"original":[104],"network.":[105],"show":[107],"graph":[110],"n":[112],"nodes,":[113],"m":[114],"\u03bc":[117,185],"changes,":[119],"admits":[120],"cTEN":[122],"O(n\u00b2\u03bc)":[124],"nodes":[125],"O(\u03bc":[127],"mn)":[128],"edges.":[129],"This":[130],"implies":[131],"can":[135],"be":[136],"solved":[137],"O(\u03bc\u00b2n\u00b3m)":[139],"using":[141,158],"combinatorial":[143],"Orlin":[148],"[Orlin,":[149],"2013],":[150],"or":[151],"O(\u03bc^(1+o(1))":[153],"(nm)^(1+o(1))":[154],"log":[155],"(nUT))":[156],"Chen":[162],"et":[163,166],"al.":[164],"[Chen":[165],"al.,":[167],"2022],":[168],"U":[170],"any":[176],"T":[179],"horizon.":[183],"When":[184],">>":[186],"m,n,":[187],"this":[188,196],"faster":[190],"than":[191],"previously":[192],"known":[193],"algorithms":[194],"for":[195],"problem.":[197]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2026-06-25T00:00:00"}