Dynamic Maxflow via Dynamic Interior Point Methods

In this paper we provide an algorithm for maintaining a (1 -ε)-approximate maximum flow in a dynamic, capacitated graph undergoing edge additions. Over a sequence of m-additions to an n-node graph where every edge has capacity O(poly(m)) our algorithm runs in time O(m √ n• ε -1 ). 1 To obtain this result we design dynamic data structures for the more general problem of detecting when the value of the minimum cost circulation in a dynamic graph undergoing edge additions obtains value at most F (exactly) for a given threshold F . Over a sequence madditions to an n-node graph where every edge has capacity O(poly(m)) and cost O(poly(m)) we solve this thresholded minimum cost flow problem in O(m √ n). Both of our algorithms succeed with high probability against an adaptive adversary. We obtain these results by dynamizing the recent interior point method used to obtain an almost linear time algorithm for minimum cost flow [CKL + 22], and introducing a new dynamic data structure for maintaining minimum ratio cycles in an undirected graph that succeeds with high probability against adaptive adversaries.

1 Throughout this paper, O(•) hides poly log(m) factors, and O(•) hides subpolynomial m o(1) factors.