38 citations · 73 across the 6 of their papers we have counts for
4 papers · 1 filter
Connectivity graphs of uncertainty regions
Erin Chambers, Alejandro Erickson, Sándor Fekete +7
We study connectivity relations among points, where the precise location of each input point lies in a region of uncertainty. We distinguish two fundamental scenarios under which u…
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…
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…
Maximal f-vectors of Minkowski sums of large numbers of polytopes
Christophe Weibel
It is known that in the Minkowski sum of polytopes in dimension , with , the number of vertices of the sum can potentially be as high as the product of the number of ve…