An Approximate Generalization of the Okamura-Seymour Theorem

Nikhil Kumar

We consider the problem of multicommodity flows in planar graphs. Okamura and Seymour showed that if all the demands are incident on one face, then the cut-condition is sufficient…