Abstract
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 language | English |
|---|---|
| Pages (from-to) | 1820-1835 |
| Number of pages | 16 |
| Journal | SIAM Journal on Discrete Mathematics |
| Volume | 31 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Jan 2017 |
| Externally published | Yes |
Keywords
- Approximation algorithm
- Ear-decomposition
- Vertex-connectivity
ASJC Scopus subject areas
- General Mathematics
Fingerprint
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver