38 citations · 73 across the 6 of their papers we have counts for
Showing 2010 · cs.DMShow all
2 papers · 2 filters
cs.DM2010
Congestion in planar graphs with demands on faces
Guyslain Naves, Christophe Weibel
We give an algorithm to route a multicommodity flow in a planar graph with congestion , where is the maximum number of terminals on the boundary of a face, when…
cs.DM2010
Flow-Cut Gaps for Integer and Fractional Multiflows
Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel
Consider a routing problem consisting of a demand graph H and a supply graph G. If the pair obeys the cut condition, then the flow-cut gap for this instance is the minimum value C…