Complexity and approximability issues of Shared Risk Resource Group

David Coudert 1 Pallab Datta 1 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 the consequences of the Shared Risk Ressource Groups (SRRG) model on classical combinatorial concepts of network survivability. It focuses on complexity and approximability issues, and on the evolutions of the relationships among these questions. We introduce a combinatorial model for SRRG based on edge-colored graphs. The notions of colored cut and colored spanning tree are introduced, the hardness and non-approximability of path, cut and spanning tree colored optimization problems are proved. We provide approximation algorithms, and investigate specific polynomial cases. Deep differences between colored combinatorial questions and their counterparts in classical graph theory are shown. In particular, results concerning the relationships among colored problems are presented.
Document type :
Reports
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/inria-00070167
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 7:18:46 PM
Last modification on : Monday, September 9, 2019 - 1:42:09 PM
Long-term archiving on : Sunday, April 4, 2010 - 8:22:29 PM

Identifiers

  • HAL Id : inria-00070167, version 1

Collections

Citation

David Coudert, Pallab Datta, Stéphane Pérennes, Hervé Rivano, Marie-Emilie Voge. Complexity and approximability issues of Shared Risk Resource Group. [Research Report] RR-5859, INRIA. 2006, pp.20. ⟨inria-00070167⟩

Share

Metrics

Record views

481

Files downloads

215