Two-connected spanning subgraphs with at most $\frac{10}{7}$OPT edges
Combinatorics
2016-09-20 v1 Discrete Mathematics
Data Structures and Algorithms
Abstract
We present a -approximation algorithm for the minimum two-vertex-connected spanning subgraph problem.
Keywords
Cite
@article{arxiv.1609.00147,
title = {Two-connected spanning subgraphs with at most $\frac{10}{7}$OPT edges},
author = {Klaus Heeger and Jens Vygen},
journal= {arXiv preprint arXiv:1609.00147},
year = {2016}
}