论文信息 - Approximating k-outconnected Subgraph Problems

Approximating k-outconnected Subgraph Problems

We present approximation algorithms and structural results for problems in network design. We give improved approximation algorithms for finding min-cost k-outconnected graphs with either a single root or multiple roots for (i) uniform costs, and (ii) metric costs. The improvements are obtained by focusing on single-root k-outconnected graphs and proving (i) a version of Mader's critical cycle theorem and (ii) an extension of a splitting off theorem by Bienstock et al.

[1] Tibor Jordán,et al. On the Optimal Vertex-Connectivity Augmentation , 1995, J. Comb. Theory B.

[2] B. Bollobás,et al. Extremal Graph Theory , 2013 .

[3] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .

[4] Stationary Probabilities Of Markov Chains With Upper Hessenberg Transition Matrices , 1997 .

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

[6] S. Khuller. Approximation algorithms for finding highly connected subgraphs , 1996 .

[7] Joseph Cheriyan,et al. Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching , 1998, Electron. Colloquium Comput. Complex..

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

[9] Zeev Nutov,et al. On Mobile Robots Flow In Locally Uniform Networks , 1997 .

[10] E TarjanRobert,et al. Faster scaling algorithms for general graph matching problems , 1991 .

[11] W. Mader. Ecken vom Gradn in minimalenn-fach zusammenhängenden Graphen , 1972 .

[12] Clyde L. Monma,et al. On the Structure of Minimum-Weight k-Connected Spanning Networks , 1990, SIAM J. Discret. Math..

[13] Joseph JáJá,et al. On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems , 1982, Theor. Comput. Sci..