论文信息 - An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph

An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph

We present an approximation algorithm for the problem of finding a minimum-cost k-vertex connected spanning subgraph, assuming that the number of vertices is at least 6k 2 . The approximation guarantee is six times the kth harmonic number (which is O(log k)), and this is also an upper bound on the integrality ratio for a standard linear programming relaxation.

Santosh S. Vempala | Adrian Vetta | Joseph Cheriyan

[1] Andrew V. Goldberg,et al. Improved approximation algorithms for network design problems , 1994, SODA '94.

[2] R. C. Entringer,et al. k-critically n-connected graphs , 1977 .

[3] David P. Williamson,et al. A primal-dual schema based approximation algorithm for the element connectivity problem , 2002, SODA '99.

[4] W. Mader,et al. Surveys in Combinatorics: Connectivity and edge-connectivity in finite graphs , 1979 .

[5] Harold N. Gabow,et al. A representation for crossing set families with applications to submodular flow problems , 1993, SODA '93.

[6] Santosh S. Vempala,et al. Approximation algorithms for minimum-cost k-vertex connected subgraphs , 2002, STOC '02.

[7] R. Ravi,et al. Chapter 36 An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems , 1999 .

[8] Mimmo Parente,et al. A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph , 1999, J. Algorithms.

[9] Samir Khuller,et al. Improved approximation algorithms for uniform connectivity problems , 1995, STOC '95.

[10] Guy Kortsarz,et al. Approximating node connectivity problems via set covers , 2000, APPROX.

[11] Tibor Jordán,et al. On Rooted Node-Connectivity Problems , 2001, Algorithmica.

[12] A. Frank,et al. An application of submodular flows , 1989 .