A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph

Vincenzo Auletta, Yefim Dinitz, Zeev Nutov, Domenico Parente

Research output: Contribution to journalArticlepeer-review

51 Scopus citations


The problem of finding a minimum weight k-vertex connected spanning subgraph in a graph G = (V, E) is considered. For k ≥ 2, this problem is known to be NP-hard. Combining properties of inclusion-minimal k-vertex connected graphs and of k-out-connected graphs (i.e., graphs which contain a vertex from which there exist k internally vertex-disjoint paths to every other vertex), we derive polynomial time algorithm for finding a ([k/2] + 1)-connected subgraph with a weight at most twice the optimum to the original problem. In particular, we obtain a 2-approximation algorithm for the case k = 3 of our problem. This improves the best previously known approximation ratio 3. The complexity of the algorithm is O(|V|3|E|) = O(|V|5).

Original languageEnglish
Pages (from-to)21-30
Number of pages10
JournalJournal of Algorithms
Issue number1
StatePublished - 1 Jan 1999

ASJC Scopus subject areas

  • Control and Optimization
  • Computational Mathematics
  • Computational Theory and Mathematics


Dive into the research topics of 'A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph'. Together they form a unique fingerprint.

Cite this