Cut problems and their application to divide-and-conquer
Approximation algorithms for NP-hard problems
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
Routing restorable bandwidth guaranteed connections using maximum 2-route flows
IEEE/ACM Transactions on Networking (TON)
Single source multiroute flows and cuts on uniform capacity networks
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for 2-Route Cut Problems
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Region growing for multi-route cuts
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2),..., (sk, tk), called terminals, an h-route cut is a set F ⊆ E of edges such that after the removal of the edges in F no pair si − ti is connected by h edge-disjoint paths (i.e., the connectivity of every si -- ti pair is at most h −1 in (V, E\F)). The h-route cut is a natural generalization of the classical cut problem for multicommodity flows (take h = 1). The main result of this paper is an O(h522h (h + log k)2)-approximation algorithm for the minimum h-route cut problem in the case that s1 = s2 =... = sk, called the single source case. As a corollary of it we obtain an approximate duality theorem for multiroute multicommodity flows and cuts with a single source. This partially answers an open question posted in several previous papers dealing with cuts for multicommodity multiroute problems.