We present an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, and capacities in m 1+o(1) time. Our ...

Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. Proceedings of the 56th Annual ACM Symposium on Theory of Computing , 2024 ...

# The minimum-cost flow problem aims to find the cheapest possible way of sending a certain amount of flow through a flow network ...

Dijkstra's algorithm finds the shortest path from a source node to every other node in a network with non-negative arc costs, and it can be used for minimum cost flow problems.

In this work, we study the minimum cost flow allocation problem with varied survivability. Given a set of demands and a capacitated network, the problem consists of allocating each demand to a set of ...

We present an algorithm for reconstruction of binary images represented on the triangular grid. The algorithm takes into consideration the three natural projections on the triangular grid and uses the ...

The maximum flow problem and its dual, the minimum cut problem, are classical combinatorial optimization problems with many applications in science and engineering; see, for example, Ahuja et al. 1 ...

This algorithm solves the minimum-cost maximum-flow problem for networks that incrementally change as new connections are added. Furthermore, in a second paper accepted by the IEEE Symposium on ...

This algorithm solves the minimum-cost maximum-flow problem for networks that incrementally change as new connections are added. Furthermore, in a second paper accepted by the IEEE Symposium on ...