Approximating subset k-connectivity problems
نویسندگان
چکیده
منابع مشابه
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 , ...
متن کاملApproximating Minimum-Power k-Connectivity
The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (sub)network is k-connected and the total power is minimum. We give a new very simple approximation algorithm for this problem that significantly improves the previously best known approximation ratios. Specifically, the approxima...
متن کاملApproximating minimum cost connectivity problems
We survey approximation algorithms and hardness results for versions of the Generalized Steiner Network (GSN) problem in which we seek to find a low cost subgraph (where the cost of a subgraph is the sum of the costs of its edges) that satisfies prescribed connectivity requirements. These problems include the following well known problems: min-cost k-flow, min-cost spanning tree, traveling sale...
متن کاملApproximating k-Spanner Problems for k>2
Given a graph G = (V ,E), a subgraph G′ = (V ,H), H ⊆ E is a k-spanner of G if for any pair of vertices u,w ∈ V it satisfies dH (u,w) kdG(u,w). The basic k-spanner problem is to find a k-spanner of a given graph G with the smallest possible number of edges. This paper considers approximation algorithms for this and some related problems for k > 2, known to be (2log 1− n)inapproximable. The basi...
متن کاملApproximating k-outconnected Subgraph Problems
We present approximation algorithms and structural results for problems in network design. We give improved approximation algorithms for nding min-cost k-outconnected graphs with either a single root or multiple roots for (i) uniform costs, and (ii) metric costs. The improvements are obtained by focusing on single-root k-outconnected graphs and proving (i) a version of Mader's critical cycle th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2012
ISSN: 1570-8667
DOI: 10.1016/j.jda.2012.08.001