Approximating Fault-Tolerant Group-Steiner Problems

In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Steiner networks from edge or vertex failures. In Fault-Tolerant Group-Steiner problems, we are given a graph with edge- (or vertex-) costs, a root vertex, and a collection of subsets of vertices called groups. The objective is to find a minimum-cost subgraph that has two edge- (or vertex-) disjoint paths from each group to the root. We present approximation algorithms and hardness results for several variants of this basic problem, e.g., edge-costs vs. vertex-costs, edge-connectivity vs. vertex-connectivity, and 2-connecting a single vertex vs. two distinct vertices from each group. Main contributions of our paper in

• Type: Conference
• Year: 2009
• Where: FSTTCS
• Authors: Rohit Khandekar, Guy Kortsarz, Zeev Nutov
• Keywords: Approximation Algorithms, FSTTCS 2009, Single Vertex Vs, Theoretical Computer Science, Vertex Failures