SHARED RISK RESOURCE GROUP COMPLEXITY AND APPROXIMABILITY ISSUES
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.
References
-
R. Bhandari , Survivable networks: Algorithms for diverse routing ( Kluwer Academic , 1999 ) . Google Scholar R. D. Carr , On the red-blue set cover problem, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (SODA) (Society for Industrial and Applied Mathematics, 2000) pp. 345–353. Google Scholar- Information Processing Letters 63(5), 277 (1997), DOI: 10.1016/S0020-0190(97)00127-0. Crossref, ISI, Google Scholar
- IEEE Communications Magazine 39(2), 81 (2001), DOI: 10.1109/35.900635. Google Scholar
P. Datta and A. K. Somani , Diverse routing for shared risk resource groups (SRRG) failures in WDM optical networks, Proceedings of IEEE BroadNets (2004) pp. 120–129, DOI: 10.1109/BROADNETS.2004.34. Google Scholar


