Faster Min-Cost Flow on Bounded Treewidth Graphs

by   Sally Dong, et al.
University of Washington

We present a O(m√(τ)+nτ) time algorithm for finding a minimum-cost flow in graphs with n vertices and m edges, given a tree decomposition of width τ and polynomially bounded integer costs and capacities. This improves upon the current best algorithms for general linear programs bounded by treewidth which run in O(m τ^(ω+1)/2) time by [Dong-Lee-Ye,21] and [Gu-Song,22], where ω≈ 2.37 is the matrix multiplication exponent. Our approach leverages recent advances in structured linear program solvers and robust interior point methods. As a corollary, for any graph G with n vertices, m edges, and treewidth τ, we obtain a O(τ^3 · m) time algorithm to compute a tree decomposition of G with width O(τ·log n).


page 1

page 2

page 3

page 4


Fast simulation of planar Clifford circuits

A general quantum circuit can be simulated in exponential time on a clas...

Constructing Tree Decompositions of Graphs with Bounded Gonality

In this paper, we give a constructive proof of the fact that the treewid...

A polynomial time algorithm to compute the connected tree-width of a series-parallel graph

It is well known that the treewidth of a graph G corresponds to the node...

Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques

Since the development of efficient linear program solvers in the 80s, al...

Finding All Leftmost Separators of Size ≤ k

We define a notion called leftmost separator of size at most k. A leftmo...

Faster Sparse Minimum Cost Flow by Electrical Flow Localization

We give an O(m^3/2 - 1/762log (U+W)) time algorithm for minimum cost flo...

Please sign up or login with your details

Forgot password? Click here to reset