2 citations · 2 across the 6 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth
Tobias Friedrich, Davis Issac, Nikhil Kumar +2
We prove an approximate max-multiflow min-multicut theorem for bounded treewidth graphs. In particular, we show the following: Given a treewidth- graph, there exists a (fraction…
cs.DM2022
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…