Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...