1 research outputs found
A -approximation for -connected subgraphs
We obtain approximation ratio for the (undirected)
-Connected Subgraph problem, where
is the largest integer such that . For large
values of this improves the -approximation of Cheriyan and V\'egh when
, which is the case . For bounded by a constant we
obtain ratio . For large values of our ratio matches the best
known ratio for the augmentation version of the problem, as well as the
best known ratios for . Similar results are shown for the problem of
covering an arbitrary crossing supermodular biset function