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 the k-route cut problem: given an undirected edge-weighted graph G=(V, E), a
collection {(s 1, t 1),(s 2, t 2),…,(sr, tr)} of source-sink pairs, and an integer connectivity …

In this paper, we investigate the problem of flow routing and fair bandwidth allocation under
interference constraints for multihop wireless networks. We first develop a novel isotonic …

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 …

We propose a bandwidth-efficient algorithmic solution for perfectly-secure communication in
the absence of secure infrastructure. Our solution involves connecting vertex pairs by a set …

Given a graph with a source and a sink node, the NP-hard maximum k-splittable s, t-flow (M
k SF) problem is to find a flow of maximum value from s to t with a flow decomposition using …

In this paper we study approximation algorithms for multi-route cut problems in undirected
graphs. In these problems the goal is to find a minimum cost set of edges to be removed …

We study a number of multi-route cut problems: given a graph G=(V, E) and connectivity
thresholds k (u, v) on pairs of nodes, the goal is to find a minimum cost set of edges or …

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 …

We consider two variants of a max-flow problem against k edge failures, each of which can
be both approximated by a multiroute flow algorithm. The maximum k-robust flow problem is …