# Network Transformations and Applications

There are so many variations of what minimum cost flow means. Sometimes an algorithm might state it only works if the costs are all positive. Here are some of the transforms, many are just from section 2.4 of [1].

In the most general formulation of the minimum cost flow problem

- Each vertex has a balance constraint.
- Each edge has lower bound(demand) and upper bound(capacity).

A flow is feasible if it’s within lower bound and upper bound and balance constraint must be satisfied at all vertices.

Min-cost flow problem finds the flow with minimum cost. Min-cost circulation is the min-cost flow problem with all balance $0$. Min-cost transshipment is the min-cost flow problem with no edge capacities. (But there is a lower bound of $0$ on all edges).

# 1 Remove all balance

This shows min-cost flow is equivalent to min-cost circulation. A common way to remove balance is add an new vertex $s$. For each vertex $v$ with balance $b_{v}$, add edge $sv$ with lower and upper bound both $−b_{v}$.

However, this might make the graph no longer have certain structural properties. For example, the graph might no longer be planar.

One way to do this is solve two problems. First compute a spanning tree $T$ of the graph. Add parallel edges from $T$ to $G$. Find flow only on those parallel edges(so it’s just a tree) that satisfies all the balance constraints. Let this flow be $f$. Make sure the cost of the flow on the added edges are infinity, and consider the residue graph. Now, solve the min-cost circulation on the residual graph and then sum with the flow $f$ gives one the desired result. This idea was first used for max flow problem with balance constraints in [2].

# 2 Remove upper and lower bounds

This shows min-cost flow is equivalent to min-cost transshipment problem. All operations are local, therefore we establish the notation. There is an edge $st$ with lower bound $l$, upper bound $u$, cost $c$. $b_{s}$ and $b_{t}$ are the balances of $s$ and $t$, respectively.

## 2.1 Remove non-zero lower bound

The idea is we just send the flow of value $l$ along the edge! We transform so the new balance for $s$ is $b_{s}−l$, new balance for $t$ is $b_{t}+l$, and the new upper bound on the edge is $u−l$. The low The cost doesn’t change.

## 2.2 Remove upper bounds

Here we assume $l=0$. If not, first remove the non-zero lower bound. We create a new node $w$ with balance $−u$. We remove the edge $st$, and split it into $sw$ and $tw$ instead. $sw$ has infinite capacity and cost $c$. $tw$ has infinite capacity and cost $0$. Finally, let the balance of $t$ be $b_{t}+u$.

The idea is instead of sending flow on $st$, now we send on $sw$. Because the balance is $−u$, we can’t send more than $u$ unit of flow. To cover the remaining balance, some flow is sent from $t$ to $w$.

# 3 Applications

Let $C$ be a class of graphs. Let $Sub(C)={G∣G⊂H,H∈C}$ be the set of subgraphs of graphs in class $C$. If there is an algorithm that solves min-cost circulation/transshipment problem for $C$, then there is an algorithm that solves min-cost flow problem on $Sub(C)$. The running time of the algorithm is only the extra time spent on complete the graph to some graph in $C$ by adding edges of $0$ capacity.

This directly implies min-cost flow on general series-parallel graphs can be solved in $O(ngn)$ time using the algorithm for min-cost circulation on $2$-terminal series-parallel graphs(Note the article solves the min-cost maximum flow problem, one can see it also works for min-cost circulation)[3]. As a corollary, one can solve min-cost flow problem on outerplanar graph in the same running time.

# References

**Network flows: Theory, algorithms, and applications**, Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1993.

**Flow in planar graphs with multiple sources and sinks**, SIAM J. Comput. 24 (1995) 1002–1017 10.1137/S0097539789162997.

**Finding the minimum-cost maximum flow in a series-parallel network**, Journal of Algorithms. 15 (1993) 416–446 10.1006/jagm.1993.1048.