Shared Risk Resource Group: Complexity and Approximability issues - Archive ouverte HAL Access content directly
Journal Articles Parallel Processing Letters Year : 2007

Shared Risk Resource Group: Complexity and Approximability issues


This article investigates complexity and approximability properties of combinatorial optimization problems yielded by the notion of Shared Risk Resource Group (SRRG). SRRG has been introduced in order to capture network survivability issues where a failure may break a whole set of resources, and has been formalized as colored graphs, where a set of resources is represented by a set of edges with same color. We consider here the analogous of classical problems such as determining paths or cuts with the minimum numbers of colors or color disjoint paths. These optimization problems are much more difficult than their counterparts in classical graph theory. In particular standard relationship such as the Max Flow - Min Cut equality do not hold any longer. In this article we identify cases where these problems are polynomial, for example when the edges of a given color form a connected subgraph, and otherwise give hardness and non approximability results for these problems.
Fichier principal
Vignette du fichier
CDP_-PPL06.pdf (295.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00371100 , version 1 (26-03-2009)


  • HAL Id : hal-00371100 , version 1


David Coudert, P. Datta, Stéphane Pérennes, Hervé Rivano, Marie-Emilie Voge. Shared Risk Resource Group: Complexity and Approximability issues. Parallel Processing Letters, 2007, 17 (2), pp.169-184. ⟨hal-00371100⟩
230 View
232 Download


Gmail Facebook Twitter LinkedIn More