Aleksander Mkadry

most citedFaster Sparse Minimum Cost Flow by Electrical Flow Localization

2 citations · 2 across the 1 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2021★ 2 cited

Faster Sparse Minimum Cost Flow by Electrical Flow Localization

Kyriakos Axiotis, Aleksander Mądry, Adrian Vladu

We give an $O (m^{3/2 - 1/762} lo g (U + W))$ time algorithm for minimum cost flow with capacities bounded by $U$ and costs bounded by $W$ . For sparse graphs with genera…

cs.DS2020

Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs

Kyriakos Axiotis, Aleksander Mądry, Adrian Vladu

We present an $m^{4/3 + o (1)} lo g W$ -time algorithm for solving the minimum cost flow problem in graphs with unit capacity, where $W$ is the maximum absolute value of any edge weight…