Shared Risk Resource Group Complexity and Approximability Issues

  title={Shared Risk Resource Group Complexity and Approximability Issues},
  author={David Coudert and P. Datta and St{\'e}phane P{\'e}rennes and Herv{\'e} Rivano and Marie-Emilie Voge},
  journal={Parallel Processing Letters},
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… CONTINUE READING
Highly Cited
This paper has 53 citations. REVIEW CITATIONS


Publications citing this paper.

53 Citations

Citations per Year
Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 24 references


  • D. S. Hochbaum
  • Approximation Algorithms for NP-Hard Problems…
  • 1997
Highly Influential
3 Excerpts

V . V . Vazirani . Approximation Algorithms

  • G. Chen, Y. Xu
  • 2002

Similar Papers

Loading similar papers…