2 citations · 2 across the 6 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
Multicommodity Flows in Planar Graphs with Demands on Faces
Nikhil Kumar
We consider the problem of multicommodity flows in planar graphs. Seymour showed that if the union of supply and demand graphs is planar, then the cut condition is sufficient for r…
cs.DS2020
Integer Plane Multiflow Maximisation : Flow-Cut Gap and One-Quarter-Approximation
Naveen Garg, Nikhil Kumar, András Sebő
In this paper, we bound the integrality gap and the approximation ratio for maximum plane multiflow problems and deduce bounds on the flow-cut-gap. Planarity means here that the un…