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

Klaus Heeger; Jens Vygen

doi:10.1137/16M1091587

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

Klaus Heeger, Jens Vygen

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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	https://doi.org/10.1137/16M1091587
State	Published - 1 Jan 2017
Externally published	Yes

Keywords

Approximation algorithm
Ear-decomposition
Vertex-connectivity

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1137/16M1091587

Cite this

@article{3149d991a5024efb9cc8ec6291d3d9dd,

title = "Two-connected spanning subgraphs with at most 10/7 OPT Edges",

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{\"o}, and Szigeti for 2-edge-connected spanning subgraphs, our algorithm is based on computing a carefully designed ear-decomposition.",

keywords = "Approximation algorithm, Ear-decomposition, Vertex-connectivity",

author = "Klaus Heeger and Jens Vygen",

note = "Publisher Copyright: {\textcopyright} 2017 Society for Industrial and Applied Mathematics.",

year = "2017",

month = jan,

day = "1",

doi = "10.1137/16M1091587",

language = "English",

volume = "31",

pages = "1820--1835",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "3",

}

TY - JOUR

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

AU - Heeger, Klaus

AU - Vygen, Jens

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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.

AB - 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.

KW - Approximation algorithm

KW - Ear-decomposition

KW - Vertex-connectivity

UR - http://www.scopus.com/inward/record.url?scp=85031710852&partnerID=8YFLogxK

U2 - 10.1137/16M1091587

DO - 10.1137/16M1091587

M3 - Article

AN - SCOPUS:85031710852

SN - 0895-4801

VL - 31

SP - 1820

EP - 1835

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 3

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this