2 papers
cs.DM2025
Improved Lower Bounds on Multiflow-Multicut Gaps
Sina Kalantarzadeh, Nikhil Kumar
Given a set of source-sink pairs, the maximum multiflow problem asks for the maximum total amount of flow that can be feasibly routed between them. The minimum multicut, a dual pro…
cs.DS2025
Unsplittable Multicommodity Flows in Outerplanar Graphs
David Alemán-Espinosa, Nikhil Kumar
We consider the problem of multicommodity flows in outerplanar graphs. Okamura and Seymour showed that the cut-condition is sufficient for routing demands in outerplanar graphs. We…