Christophe Weibel

activity

20052012

most citedOn f-vectors of Minkowski additions of convex polytopes

38 citations · 73 across the 6 of their papers we have counts for

collaborators

Showing cs.DMShow all

3 papers · 1 filter

cs.DM2012

When the Cut Condition is Enough: A Complete Characterization for Multiflow Problems in Series-Parallel Networks

Amit Chakrabarti, Lisa Fleischer, Christophe Weibel

Let $G = (V, E)$ be a supply graph and $H = (V, F)$ a demand graph defined on the same set of vertices. An assignment of capacities to the edges of $G$ and demands to the edges of $H$ is…

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 $G$ with congestion $O (lo g k)$ , where $k$ 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…