Two-connected spanning subgraphs with at most $\frac{10}{7}$OPT edges

arxiv: 1609.00147 · v1 · pith:6GPX3ZV4new · submitted 2016-09-01 · 🧮 math.CO · cs.DM· cs.DS

Two-connected spanning subgraphs with at most frac{10}{7}OPT edges

Klaus Heeger , Jens Vygen This is my paper

classification 🧮 math.CO cs.DMcs.DS

keywords fracspanningalgorithmapproximationedgesminimumproblemsubgraph

0 comments

read the original abstract

We present a $\frac{10}{7}$-approximation algorithm for the minimum two-vertex-connected spanning subgraph problem.

This paper has not been read by Pith yet.