Survivable network activation problems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


In the Survivable Networks Activation problem we are given a graph G = (V,E), S V, a family {f uv (x u ,x v ) : uv ∈ E} of monotone non-decreasing activating functions from ℝ 2 + to {0,1} each, and connectivity requirements {r(u,v) : u, v ∈ V}. The goal is to find a weight assignment w = {w v : v ∈ V} of minimum total weight w(V) = v∈V w v, such that: for all u, v ∈ V, the activated graph G w = (V,E w ), where E w = {uv : f uv (w u ,w v)=1}, contains r(u,v) pairwise edge-disjoint uv-paths such that no two of them have a node in S\{u,v} in common. This problem was suggested recently by Panigrahi [12], generalizing the Node-Weighted Survivable Network and the Minimum-Power Survivable Network problems, as well as several other problems with motivation in wireless networks. We give new approximation algorithms for this problem. For undirected/directed graphs, our ratios are O(κ logn) for κ-Out/In-connected Subgraph Activation and κ-Connected Subgraph Activation. For directed graphs this solves a question from [12] for κ = 1, while for the min-power case and κ arbitrary this solves an open question from [9]. For other versions on undirected graphs, our ratios match the best known ones for the Node-Weighted Survivable Network problem [8].

Original languageEnglish
Title of host publicationLATIN 2012
Subtitle of host publicationTheoretical Informatics - 10th Latin American Symposium, Proceedings
Number of pages12
StatePublished - 2012
Event10th Latin American Symposiumon Theoretical Informatics, LATIN 2012 - Arequipa, Peru
Duration: 16 Apr 201220 Apr 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7256 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference10th Latin American Symposiumon Theoretical Informatics, LATIN 2012


Dive into the research topics of 'Survivable network activation problems'. Together they form a unique fingerprint.

Cite this