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 …

Recently, many algorithms are proposed to find a communication flow that is robust against
k-edges failures. That flow can be weaker, if attackers can obtain forwarding information in …

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 …

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 …

Multi-commodity flows and cuts in graphs are among the most extensively studied
combinatorial objects. Due to their rich connections to many combinatorial optimization …

There are many polynomial-time algorithms that solve the maximum network flow problem
(max-flow), including the recent results of Orlin (2013) where the max-flow of a network with …

We develop new approximation algorithms for three graph-theoretic optimization problems.
Two of these problems arise in communication networks and the third comes up in the …