On k-connectivity problems with sharpened triangle inequality
نویسندگان
چکیده
Article history: Received 21 May 2007 Accepted 28 March 2008 Available online 4 April 2008
منابع مشابه
An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality
Consider a complete graph G with the edge weights satisfying the β-sharpened triangle inequality: weight(u, v) ≤ β(weight(u, x)+ weight(x, v)), for 1/2 ≤ β < 1. We study the NP-hard problem of finding a minimum weight spanning subgraph of G which is k-vertex-connected, k ≥ 2, and give a detailed analysis of an approximation quadratic-time algorithm whose performance ratio is β 1−β . The algorit...
متن کاملOn the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality
In this paper we investigate the problem of finding a 2-connected spanning subgraph of minimal cost in a complete and weighted graph G. This problem is known to be APX-hard, for both the edge and the vertex connectivity case. Here we prove that theAPX-hardness still holds even if one restricts the edge costs to an interval [1, 1+ε], for an arbitrary small ε > 0. This result implies the first ex...
متن کاملFinding k-Connected Subgraphs with Minimum Average Weight
We consider the problems of finding k-connected spanning subgraphs with minimum average weight. We show that the problems are NP-hard for k > 1. Approximation algorithms are given for four versions of the minimum average edge weight problem: 1. 3-approximation for k-edge-connectivity, 2. O(logk) approximation for k-node-connectivity 3. 2+ approximation for k-node-connectivity in Euclidian graph...
متن کاملThe Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality
In this paper, we deal with several reoptimization variants of the Steiner tree problem in graphs obeying a sharpened β-triangle inequality. A reoptimization algorithm exploits the knowledge of an optimal solution to a problem instance for finding good solutions for a locally modified instance. We show that, in graphs satisfying a sharpened triangle inequality (and even in graphs where edge-cos...
متن کاملThe k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs. We solve the problems for undirected and directed graphs. We then use these exact algorithms to give improved approximation algorithms for problems in which the weights satisfy the triangle inequality and the connect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Discrete Algorithms
دوره 6 شماره
صفحات -
تاریخ انتشار 2008