We consider a generalization of the unsplittable maximum two-commodity flow problem on undirected graphs where each commodity <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${i \in \{1, 2\}}$$</EquationSource> </InlineEquation> can be split into a bounded number k <Subscript> i </Subscript> of equally-sized chunks that can be routed on different paths. We show that in contrast to the...</subscript></equationsource></inlineequation>

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 of equally-sized chunks that can be routed on different paths. We show that in contrast to the...