Improved bounds for the unsplittable flow problem

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) with associated demands, find a subset of the pairs of maximum total demand for which a single flow path can be chosen for each pair so that for every edge, the sum of the demands of the paths crossing the edge does not exceed its capacity. We present a collection of new results for the UFP both in the offline (all requests are given from the beginning) and the online (requests arrive at the system one after the other) setting. A fundamental ingredient of our analysis is

• Type: Journal
• Year: 2006
• Where: JAL
• Authors: Petr Kolman, Christian Scheideler
• Keywords: JAL 2006, Maximum Total Demand, Single Flow Path, Unsplittable Flow Problem