Min-Cost Flow in Unit-Capacity Planar Graphs

by   Adam Karczmarz, et al.

In this paper we give an O((nm)^2/3 C) time algorithm for computing min-cost flow (or min-cost 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 C) time algorithm of Cohen et al. [SODA 2017], the O(m^3/2(nC)) time algorithm of Gabow and Tarjan [SIAM J. Comput. 1989] and the O(√(n)m C) time algorithm of Lee and Sidford [FOCS 2014]. In particular, our result constitutes the first known fully combinatorial algorithm that breaks the O(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/2C) 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.


page 1

page 2

page 3

page 4


A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs

The vitality of an edge in a graph with respect to the maximum flow betw...

Multi-Terminal Shortest Paths in Unit-Weight Planar Graphs in Linear Time

Given a set of terminal pairs on the external face of a planar graph wit...

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

We present an m^11/8+o(1)log W-time algorithm for solving the minimum co...

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time

We present a nearly-linear time algorithm for finding a minimum-cost flo...

Optimally Reliable Cheap Payment Flows on the Lightning Network

Today, payment paths in Bitcoin's Lightning Network are found by searchi...

Servicing Timed Requests on a Line

We consider an off-line optimisation problem where k robots must service...

A Note on Maximum Integer Flows in Directed Planar Graphs with Vertex Capacities

The most efficient algorithm currently known for computing maximum integ...

Please sign up or login with your details

Forgot password? Click here to reset