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

Peer-to-peer (P2P) systems, which are realized as overlays on top of the underlying Internet
routing architecture, contribute a significant portion of today's Internet traffic. While the P2P …

Practical distributed quantum computing requires the development of efficient compilers,
able to make quantum circuits compatible with some given hardware constraints. This …

We present a survey about the maximum integral multiflow and minimum multicut problems
and their subproblems, such as the multiterminal cut and the unsplittable flow problems. We …

We present approximation algorithms for the unsplittable flow problem (UFP) in undirected
graphs. As is standard in this line of research, we assume that the maximum demand is at …

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 traditional multi-commodity flow theory, the task is to send a certain amount of each
commodity from its start to its target node, subject to capacity constraints on the edges …

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 …

Recent results have shown that topology aware mapping reduces network contention in
communication-intensive kernels on massively parallel machines. We demonstrate that on …

We study the parameterized complexity of two families of problems: the bounded length
disjoint paths problem and the bounded length cut problem. From Menger's theorem both …