Faster Sparse Minimum Cost Flow by Electrical Flow Localization.

Kyriakos Axiotis Aleksander Madry Adrian Vladu

Published in: FOCS (2022)

Keyphrases

minimum cost flow
bi objective
network simplex algorithm
minimum cost
strongly polynomial
shortest path
shortest path algorithm
bipartite matching
network flow problem
efficient solutions
multiple objectives
shortest path problem