A Polynomial Time Approximation Algorithm for the Two-Commodity Splittable Flow Problem

Elke Eisenschmidt, Utz-Uwe Haus

We consider a generalization of the unsplittable maximum two-commodity flow problem on undirected graphs where each commodity $i\in 1,2$ can be split into a bounded number $k_i$ o…