By Topic

Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Zeev Nutov ; Open Univ. of Israel, Raanana, Israel

We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph G = (V, E) with edge/node costs, a node subset S ¿ V, and connectivity requirements {r(s, t) : s,t ¿ T ¿ V}. The goal is to find a minimum cost subgraph H that for all s, t ¿ T contains r(s, t) pairwise edge-disjoint si-paths so that no two of them have a node in S - {s, t} in common. Three extensively studied particular cases are: Edge-GSN (S = 0), Node-GSN (S = V), and Element-GSN (r(s,t) = 0 whenever s ¿ S or t ¿ S). Let k = maxs,t¿T r(s, t). In Rooted GSN there is s ¿ T so that r(u, t) = 0 for all u¿s, and in the Subset k-Connected Subgraph problem r(s, t) = k for all s, t ¿ T. For edge costs, our ratios are: O(k2) for Rooted GSN and O(k2 log k) for Subset k-Connected Subgraph. This improves the previous ratio O(k2 log n) and settles the approximability of these problems to a constant for bounded k. For node-cost, our ratios are: (1) O(k log |T|) for Element-GSN, matching the best known ratio for Edge-GSN. (2) O(k2 log |T|) for Rooted GSN and O(k3 log |T|) for Subset k-Connected Subgraph, improving the ratio O(ks log2 |T|). (3) O(k4 log2 |T|) for GSN; this is the first non-trivial approximation algorithm for the problem.

Published in:

Foundations of Computer Science, 2009. FOCS '09. 50th Annual IEEE Symposium on

Date of Conference:

25-27 Oct. 2009