Cookies?
Library Header Image
LSE Research Online LSE Library Services

Approximating minimum-cost k-node connected subgraphs via independence-free graphs

Cheriyan, Joseph and Végh, László A. (2013) Approximating minimum-cost k-node connected subgraphs via independence-free graphs. In: FOCS 2013 - 54th Annual Symposium on Foundations of Computer Science, 27-29 October 2013, Berkeley, CA.

Full text not available from this repository.

Abstract

We present a 6-approximation algorithm for the minimum-cost k-node connected spanning subgraph problem, assuming that the number of nodes is at least k^3(k-1)+k. We apply a combinatorial preprocessing, based on the Frank-Tardos algorithm for k-outconnectivity, to transform any input into an instance such that the iterative rounding method gives a 2-approximation guarantee. This is the first constant-factor approximation algorithm even in the asymptotic setting of the problem, that is, the restriction to instances where the number of nodes is lower bounded by a function of k.

Item Type: Conference or Workshop Item (Paper)
Additional Information: © 2013 The Authors
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Sets: Departments > Mathematics
Date Deposited: 03 Dec 2014 10:30
Last Modified: 03 Dec 2014 10:30
URI: http://eprints.lse.ac.uk/id/eprint/56681

Actions (login required)

View Item View Item