A $(4+epsilon)$-approximation for $k$-connected subgraphs

arXiv: Data Structures and Algorithms, 2019.

Cited by: 0|Views3

Abstract:

We obtain approximation ratio $2(2+frac{1}{ell})$ for the (undirected) $k$-Connected Subgraph problem, where $ell approx frac{1}{2} (log_k n-1)$ is the largest integer such that $2^{ell-1} k^{2ell+1} leq n$. For large values of $n$ this improves the $6$-approximation of Cheriyan and Vu0027egh when $n =Omega(k^3)$, which is the case $ell=1...More

Code:

Data:

Your rating :
0

 

Tags
Comments