Min-Cost Flow in Unit-Capacity Planar Graphs

Abstract

In this paper we give an O((nm) 2/3 log C) time algorithm for computing min-cost flow (or mincost circulation) in unit capacity planar multigraphs where edge costs are integers bounded by C. For planar multigraphs, this improves upon the best known algorithms for general graphs: the O(m 10/7 log C) time algorithm of Cohen et al. [SODA 2017], the O(m 3/2 log(nC)) time algorithm of Gabow and Tarjan [SIAM J. Comput. 1989] and the O( √ nm log C) time algorithm of Lee and Sidford [FOCS 2014]. In particular, our result constitutes the first known fully combinatorial algorithm that breaks the Ω(m 3/2 ) time barrier for min-cost flow problem in planar graphs.To obtain our result we first give a very simple successive shortest paths based scaling algorithm for unit-capacity min-cost flow problem that does not explicitly operate on dual variables. This algorithm also runs in O(m 3/2 log C) time for general graphs, and, to the best of our knowledge, it has not been described before. We subsequently show how to implement this algorithm faster on planar graphs using well-established tools: r-divisions and efficient algorithms for computing (shortest) paths in so-called dense distance graphs.

Optimal Curve Straightening is $\exists\mathbb{R}$-Complete

“…Interestingly, given a closed curve γ with n self-intersection points, we can compute the minimumcomplexity orthogonal polygon isotopic to γ in O(n 4/3 polylog n) time, by combining Tamassia's reduction from minimum-bend grid embeddings to minimum-cost flows [65] with a recent planar minimum-cost flow algorithm of Karczmarz and Sankowski [41]; see also Cornelson and Karrenbauer [23].…”