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 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 …

An elementary h-route flow, for an integer h≥ 1, is a set of h edge-disjoint paths between a
source and a sink, each path carrying a unit of flow, and an h-route flow is a non-negative …

We study the k-route generalizations of various cut problems, the most general of which is k-
route multicut (k-MC) problem, wherein we have r source-sink pairs and the goal is to delete …

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 …

Given an integer h, a graph G=(V, E) with arbitrary positive edge capacities and k pairs of
vertices (s 1, t 1),(s 2, t 2),…,(sk, tk), called terminals, an h-route cut is a set F⊆ E of edges …

In a directed flow network we assign capacities on vertices as well as on edges. We
consider a (δ, η)-balanced flow problem of single commodity case. A (δ, η)-balanced flow is …

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 …

In this work we propose a novel approach addressing the need for a spatially equitable
distribution of the flows when routing multiple commodities on a capacitated network. In our …