The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs

TL;DR

There is a polynomial-time 4-approximation algorithm for the following problem: given a $2-T-connected graph G=(V,E)$, identify a subset E of minimum cardinality such that $(V,E^{2T})$ is $2$-T-connected.

Abstract

Let $G=(V,E)$ be a strongly connected graph with $|V|\geq 3$. For $T\subseteq V$, the strongly connected graph $G$ is $2$-T-connected if $G$ is $2$-edge-connected and for each vertex $w$ in $T$, $w$ is not a strong articulation point. This concept generalizes the concept of $2$-vertex connectivity when $T$ contains all the vertices in $G$. This concept also generalizes the concept of $2$-edge connectivity when $|T|=0$. The concept of $2$-T-connectivity was introduced by Durand de Gevigney and Szigeti in $2018$. In this paper, we prove that there is a polynomial-time 4-approximation algorithm for the following problem: given a $2$-T-connected graph $G=(V,E)$, identify a subset $E^ {2T} \subseteq E$ of minimum cardinality such that $(V,E^{2T})$ is $2$-T-connected.

Figures (1)

• Figure 1: (a) A $2$-T-connected graph $G$ for T$=\lbrace 8\rbrace$. (b) A $2$-edge-connected subgraph of the graph $G$. Note that this subgraph is not $2$-T-connected for T$=\lbrace 8\rbrace$. (c) An optimal solution for M2TC.

Theorems & Definitions (10)

• Lemma 2.2
• proof
• Theorem 2.3
• proof
• Theorem 2.4
• proof
• Lemma 3.1
• proof
• Theorem 4.2
• proof