Shared Risk Resource Group: Complexity and Approximability issues

David Coudert 1 P. Datta 2 Stéphane Pérennes 1 Hervé Rivano 1 Marie-Emilie Voge 1
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : 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.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00371100
Contributor : Hervé Rivano <>
Submitted on : Thursday, March 26, 2009 - 2:47:36 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Document(s) archivé(s) le : Thursday, June 10, 2010 - 6:48:57 PM

File

CDP_-PPL06.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00371100, version 1

Collections

Citation

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

Share

Metrics

Record views

428

Files downloads

219