Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

We study multicommodity routing problems in both edge and node capacitated undirected
graphs. The input to each problem is a capacitated graph G=(V, E) and a set Τ of node pairs …

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 …

We consider the all-or-nothing multicommodity flow problem in general graphs. We are
given a capacitated undirected graph G=(V, E, u) and set of k pairs s 1 t 1, s 2 t 2,…, sktk …

The approximability of the maximum edge-disjoint paths problem (EDP) in directed graphs
was seemingly settled by an Ω (m 1/2-ϵ)-hardness result of Guruswami et al.[2003], and an …

We consider the unsplittable flow problem (UFP) and the closely related column-restricted
packing integer programs (CPIPs). In UFP we are given an edge-capacitated graph G=(V, E) …

We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either
match or improve the previously best results. In the UFP we are given a (possibly directed) …

Unsplittable flow problems cover a wide range of telecommunication and transportation
problems and their efficient resolution is key to a number of applications. In this work, we …

We consider the all-or-nothing multicommodity flow problem in general graphs. We are
given a capacitated undirected graph G=(V,E,u) and a set of k node pairs s_1t_1,s_2t_2 …

Finding disjoint paths in graphs is a problem that has attracted considerable attention from at
least three perspectives: graph theory, VLSI design and network routing/flow. The …