A 1-(S, T)-edge-connectivity augmentation algorithm
نویسنده
چکیده
We present a combinatorial algorithm for the 1-(S; T)-edge-connectivity augmentation problem in digraphs. The general k-(S; T)-edge-connectivity augmentation problem was rst solved by A. Frank and T. Jordd an, Minimal Edge-coverings by Pairs of Sets, Journal of Combinatorial Theory Ser. B, submitted, but their proof does not yield a polynomial-time algorithm. Our algorithm generalizes an earlier result of P. Eswaran and R. E. Tarjan and relies heavily on the nature of the special case k = 1.
منابع مشابه
NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph
Abst rac t . Given an undirected graph G = (V, E0) with IVI-n, and a feasible set E of m weighted edges on V, the optimal 2-edge (2-vertex) connectivity augmentation problem is to find a subset S* __ E such that G(V, E0 U S*) is 2-edge (2-vertex) connected and the weighted sum of edges in S* is minimized. We devise NC approximation algorithms for the optimal 2-edge connectivity and the optimal ...
متن کاملApproximating Subset k-Connectivity Problems
A subset T ⊆ V of terminals is k-connected to a root s in a directed/undirected graph J if J has k internally-disjoint vs-paths for every v ∈ T ; T is k-connected in J if T is k-connected to every s ∈ T . We consider the Subset k-Connectivity Augmentation problem: given a graph G = (V,E) with edge/node-costs, node subset T ⊆ V , and a subgraph J = (V,EJ ) of G such that T is k-connected in J , ...
متن کاملSimpler Sequential and Parallel Biconnectivity Augmentation
For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components and a minimum vertex separator is a vertex separator of least cardinality. The vertex connectivity refers to the size of a minimum vertex separator. For a connected graph G with vertex connectivity k (k ≥ 1), the connectivity augmentation refers to a set S of edges whose augmentation toG...
متن کاملA Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کاملA Fixed-parameter algorithms for minimum cost edge-connectivity augmentation
We consider connectivity-augmentation problems in a setting where each potential new edge has a nonnegative cost associated with it, and the task is to achieve a certain connectivity target with at most p new edges of minimum total cost. The main result is that the minimum cost augmentation of edge-connectivity from k − 1 to k with at most p new edges is fixed-parameter tractable parameterized ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 84 شماره
صفحات -
تاریخ انتشار 1999