TY - JOUR

T1 - Approximating rooted connectivity augmentation problems

AU - Nutov, Zeev

N1 - Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.

PY - 2006/4

Y1 - 2006/4

N2 - A graph is called ℓ-connected from U to r if there are ℓ internally disjoint paths from every node u ∈ U to r. The Rooted Subset Connectivity Augmentation Problem (RSCAP) is as follows: given a graph G=(V+r,E), a node subset U ⊆ V, and an integer k, find a smallest set F of new edges such that G+F is k-connected from U to r. In this paper we consider mainly a restricted version of RSCAP in which the input graph G is already (k-1)-connected from U to r. For this version we give an O(in|U|)-approximation algorithm, and show that the problem cannot achieve a better approximation guarantee than the Set Cover Problem (SCP) on |U| elements and with |V|-|U| sets. For the general version of RSCAP we give an O(In k In|U|)-approximation algorithm. For U=V we get the Rooted Connectivity Augmentation Problem} (RCAP). For directed graphs RCAP is polynomially solvable, but for undirected graphs its complexity status is not known: no polynomial algorithm is known, and it is also not known to be NP-hard. For undirected graphs with the input graph G being (k-1)-connected from V to r, we give an algorithm that computes a solution of size at most opt + min{opt,k}/2, where opt denotes the optimal solution size.

AB - A graph is called ℓ-connected from U to r if there are ℓ internally disjoint paths from every node u ∈ U to r. The Rooted Subset Connectivity Augmentation Problem (RSCAP) is as follows: given a graph G=(V+r,E), a node subset U ⊆ V, and an integer k, find a smallest set F of new edges such that G+F is k-connected from U to r. In this paper we consider mainly a restricted version of RSCAP in which the input graph G is already (k-1)-connected from U to r. For this version we give an O(in|U|)-approximation algorithm, and show that the problem cannot achieve a better approximation guarantee than the Set Cover Problem (SCP) on |U| elements and with |V|-|U| sets. For the general version of RSCAP we give an O(In k In|U|)-approximation algorithm. For U=V we get the Rooted Connectivity Augmentation Problem} (RCAP). For directed graphs RCAP is polynomially solvable, but for undirected graphs its complexity status is not known: no polynomial algorithm is known, and it is also not known to be NP-hard. For undirected graphs with the input graph G being (k-1)-connected from V to r, we give an algorithm that computes a solution of size at most opt + min{opt,k}/2, where opt denotes the optimal solution size.

KW - Approximation algorithms

KW - Augmentation problems

KW - Hardness of approximation

KW - Rooted connectivity

UR - http://www.scopus.com/inward/record.url?scp=32244437176&partnerID=8YFLogxK

U2 - 10.1007/s00453-005-1150-5

DO - 10.1007/s00453-005-1150-5

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:32244437176

SN - 0178-4617

VL - 44

SP - 213

EP - 231

JO - Algorithmica

JF - Algorithmica

IS - 3

ER -