Min-Cost 2-Connected Subgraphs With k Terminals

Details Min-Cost 2-Connected Subgraphs With k Terminals Min-Cost 2-Connected Subgraphs With k Terminals

2008-02-18

arxiv.org/abs/0802.2528v1

Computer Science

Data Structures and Algorithms

18 pages, 3 figures

Scientific paper

In the k-2VC problem, we are given an undirected graph G with edge costs and an integer k; the goal is to find a minimum-cost 2-vertex-connected subgraph of G containing at least k vertices. A slightly more general version is obtained if the input also specifies a subset S \subseteq V of terminals and the goal is to find a subgraph containing at least k terminals. Closely related to the k-2VC problem, and in fact a special case of it, is the k-2EC problem, in which the goal is to find a minimum-cost 2-edge-connected subgraph containing k vertices. The k-2EC problem was introduced by Lau et al., who also gave a poly-logarithmic approximation for it. No previous approximation algorithm was known for the more general k-2VC problem. We describe an O(\log n \log k) approximation for the k-2VC problem.

Affiliated with

Also associated with

No associations

Rating

Min-Cost 2-Connected Subgraphs With k Terminals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Min-Cost 2-Connected Subgraphs With k Terminals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Min-Cost 2-Connected Subgraphs With k Terminals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-198208