Two-connected spanning subgraphs with at most 10/7 OPT Edges

Klaus Heeger, Jens Vygen

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


We present a 10/7 -approximation algorithm for the minimum 2-vertex-connected span- ning subgraph problem. Similarly to the work of Cheriyan, Sebö, and Szigeti for 2-edge-connected spanning subgraphs, our algorithm is based on computing a carefully designed ear-decomposition.

Original languageEnglish
Pages (from-to)1820-1835
Number of pages16
JournalSIAM Journal on Discrete Mathematics
Issue number3
StatePublished - 1 Jan 2017
Externally publishedYes


  • Approximation algorithm
  • Ear-decomposition
  • Vertex-connectivity

ASJC Scopus subject areas

  • Mathematics (all)


Dive into the research topics of 'Two-connected spanning subgraphs with at most 10/7 OPT Edges'. Together they form a unique fingerprint.

Cite this