Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Friday, September 29, 2023 3:30 PM EDT
Title: An Approximate Generalization of the Okamura-Seymour Theorem
| Speaker: | Nikhil Kumar |
| Affiliation: | University of Waterloo |
| Location: | MC 5501 |
Abstract: 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 for routing demands.