Pinning on Tight Cuts: Improved Algorithm and Bounds for Unsplittable Multicommodity Flows in Outerplanar Graphs

arXiv:2606.04456v1 Announce Type: new Abstract: The multicommodity flow problem in an undirected capacitated graph $G$ is specified by a set of source-sink pairs with nonnegative demands. A flow is feasible if it routes all demands without exceeding the edge capacities, and it is unsplittable if it routes each demand along a single path. Let $\alpha$ be the smallest value such that the existence of a feasible flow implies the existence of an unsplittable flow that exceeds the edge capacities by at most $+\,\alpha\,d_{\max}$, where $d_{\max}$ is the maximum demand value. Schrijver, Seymour, and Winkler showed that $\alpha\in\left[1.01,\,1.5\right]$ if $G$ is a cycle. These bounds were ultimately improved to $\alpha\in\left[1.1,\,1.3\right]$ by Skutella and D\"aubel. Recently, Alem\'an Espinosa and Kumar extended this constant upper bound to the broader class of outerplanar graphs, and showed that if $G$ is outerplanar then $\alpha\le 3.6$. We show that $\alpha\in\left[\tfrac{4}{3},2\right]$ if $G$ is outerplanar. We introduce a novel technique that considers the global parameters of the instance, and that may be useful in other (more general) settings where the cut-condition is sufficient, or nearly sufficient, for the existence of a feasible flow.