Unsplittable multicommodity flows in outerplanar graphs

Applied Nanoscience · Springer Nature · 2026-09-23 · DOI: 10.1007/s10107-026-02406-5

Аннотация

We consider the problem of multicommodity flows in outerplanar graphs. Okamura and Seymour [8] showed that the cut-condition is sufficient for routing demands in outerplanar graphs. We consider the unsplittable version of the problem and prove that if the cut-condition is satisfied, then each demand can be routed along a single path while violating the capacity of each edge by at most an additive amount of 3.6 times the maximum demand value.

Читать у издателя →

Похожие статьи