{"id":"https://openalex.org/W4302017455","doi":"https://doi.org/10.4230/lipics.icalp.2026.136","title":"Back in the Saddle: Toward Parallel Approximate Minimum-Cost Flow","display_name":"Back in the Saddle: Toward Parallel Approximate Minimum-Cost Flow","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W4302017455","doi":"https://doi.org/10.4230/lipics.icalp.2026.136"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26525","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.136","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.136/LIPIcs.ICALP.2026.136.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","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":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.136/LIPIcs.ICALP.2026.136.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Kyng, Rasmus","orcid":"https://orcid.org/0000-0002-8268-6258"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Kyng, Rasmus","raw_affiliation_strings":["ETH Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-8268-6258","affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":null,"display_name":"Sulser, Aurelio L.","orcid":"https://orcid.org/0009-0007-4546-5978"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Sulser, Aurelio L.","raw_affiliation_strings":["ETH Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0009-0007-4546-5978","affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":null,"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/T12546","display_name":"Smart Parking Systems Research","score":0.8673999905586243,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.8673999905586243,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.8224999904632568,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.8115000128746033,"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/transshipment","display_name":"Transshipment (information security)","score":0.7393826842308044},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7073706984519958},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6733664274215698},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6147646903991699},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6085624694824219},{"id":"https://openalex.org/keywords/boosting","display_name":"Boosting (machine learning)","score":0.547849178314209},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5002791881561279},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.47259363532066345},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.46696215867996216},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3365243673324585},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19440093636512756},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15628361701965332},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10293889045715332}],"concepts":[{"id":"https://openalex.org/C2776234997","wikidata":"https://www.wikidata.org/wiki/Q17134191","display_name":"Transshipment (information security)","level":2,"score":0.7393826842308044},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7073706984519958},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6733664274215698},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6147646903991699},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6085624694824219},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.547849178314209},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5002791881561279},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.47259363532066345},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.46696215867996216},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3365243673324585},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19440093636512756},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15628361701965332},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10293889045715332},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26525","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.136","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.136/LIPIcs.ICALP.2026.136.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","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.icalp.2026.136","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.136","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"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:26525","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.136","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.136/LIPIcs.ICALP.2026.136.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4302017455.pdf","grobid_xml":"https://content.openalex.org/works/W4302017455.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2989662842","https://openalex.org/W3164383682","https://openalex.org/W2081792944","https://openalex.org/W1977436202","https://openalex.org/W2125652721","https://openalex.org/W2063230249","https://openalex.org/W2138955107","https://openalex.org/W1540371141","https://openalex.org/W1971899740","https://openalex.org/W4231274751"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,85,94,146,174],"first":[3],"polylog-depth,":[4],"nearly-linear-work":[5],"parallel":[6,99],"algorithm":[7],"that":[8,57,132,165],"achieves":[9],"a":[10,54,109,122,129,140,188],"(1+\u03b5)-bicriteria":[11],"approximation":[12],"guarantee":[13,77],"for":[14,98,114,198],"undirected":[15,22,200],"minimum-cost":[16,126,201],"flow":[17,55,127,202],"on":[18,102,151,203],"expanders.":[19],"Fix":[20],"an":[21],"graph":[23],"G":[24],"=":[25,70],"(V,E)":[26],"with":[27],"unit":[28,30],"capacities,":[29],"lengths,":[31],"and":[32,41,51,66,81,92,135,157,186,194],"conductance":[33],"\u03d5.":[34],"For":[35],"any":[36,42],"feasible":[37],"demand":[38],"vector":[39],"d":[40,59],"\u03b5":[43],"\u2208":[44],"(0,1)":[45],"we":[46,119],"compute,":[47],"in":[48],"O\u0303(|E|/(\u03b5\u03d5))":[49],"work":[50,193],"O\u0303(1/(\u03b5\u03d5))":[52],"depth,":[53],"f":[56],"routes":[58],"exactly":[60],"while":[61],"satisfying":[62],"\u2016f\u2016_\u221e":[63],"\u2264":[64,68,73],"1+\u03b5":[65],"\u2016f\u2016_1":[67],"(1+\u03b5)min_{Bg":[69],"d,":[71],"\u2016g\u2016_\u221e":[72],"1}}\u2016g\u2016_1.":[74],"This":[75],"bicriteria":[76],"simultaneously":[78],"controls":[79],"congestion":[80],"total":[82],"cost,":[83],"strengthens":[84],"previously":[86],"studied":[87],"notion":[88],"of":[89],"throughput":[90],"error,":[91],"matches":[93],"best":[95],"known":[96],"\u03b5-dependence":[97],"maximum":[100],"flow/transshipment":[101],"general":[103,204],"graphs.":[104,205],"Our":[105],"main":[106],"contribution":[107],"is":[108],"new":[110],"saddle-point":[111,130],"optimization":[112,181],"method":[113],"mixed":[115,179],"\ud835\udcc1_\u221e-\ud835\udcc1_1":[116,180],"optimization.":[117],"Concretely,":[118],"(i)":[120],"formulate":[121],"two-term":[123],"regression":[124],"capturing":[125],"as":[128],"problem":[131],"couples":[133],"\ud835\udcc1_\u221e":[134],"\ud835\udcc1_1":[136],"terms,":[137],"(ii)":[138],"construct":[139],"small-magnitude":[141],"area-convex":[142],"regularizer":[143],"tailored":[144],"to":[145],"resulting":[147],"primal\u2013dual":[148],"domain":[149],"(building":[150],"Sherman\u2019s":[152,166],"area-convexity":[153],"framework":[154],"[Sherman,":[155],"2017]),":[156],"(iii)":[158],"implement":[159],"efficient":[160],"\u03b4-approximate":[161],"maximization/minimization":[162],"oracles":[163],"so":[164],"extragradient":[167],"iteration":[168],"yields":[169],"low":[170],"iteration-count":[171],"convergence.":[172],"Beyond":[173],"concrete":[175],"expander":[176],"result,":[177],"our":[178],"toolkit":[182],"appears":[183],"broadly":[184],"applicable":[185],"suggests":[187],"promising":[189],"route":[190],"toward":[191],"O\u0303(m/\u03b5)":[192],"O\u0303(1/\u03b5)":[195],"depth":[196],"algorithms":[197],"approximate":[199]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-03T06:15:21.484131","created_date":"2022-10-06T00:00:00"}