Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs

Sally Dong, Guanghao Ye

We present an algorithm for min-cost flow in graphs with $n$ vertices and $m$ edges, given a tree decomposition of width $\ddot{I}„$ and size $S$, and polynomially bounded, integral edge…