论文信息 - Better Algorithms for Minimum Weight Vertex-Connectivity Problems

Better Algorithms for Minimum Weight Vertex-Connectivity Problems

Given a k vertex-connected graph with weighted edges, we study the problem of finding a minimum weight spanning subgraph which is k vertex-connected, for small values of k. The problem is known to be NP-hard for any k, even when edges have no weight.

Mimmo Parente | Vincenzo Auletta | Mimmo Parente | V. Auletta

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

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

[3] M. Stoer. Design of Survivable Networks , 1993 .

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

[5] Samir Khuller,et al. Approximation Algorithms for Graph Augmentation , 1992, ICALP.

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

[7] A. Frank. Applications of submodular functions , 1993 .

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

[9] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[10] Michal Penn,et al. Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems , 1997, J. Algorithms.