TY - GEN

T1 - Finding optimum k-vertex connected spanning subgraphs

T2 - 3rd Italian Conference on Algorithms and Complexity, CIAC 1997

AU - Dinitz, Yefim

AU - Nutov, Zeev

N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.

PY - 1997/1/1

Y1 - 1997/1/1

N2 - The problem of finding a minimum weight k-vertex connected spanning subgraph is considered. For k>1, this problem is known to be NP-hard. Combining properties of inclusion-minimal k-vertex connected graphs and of k-out-connected graphs (i.e., graphs which contain a vertex from which there are k internally vertex-disjoint paths to every other vertex), we derive polynomial time approximation algorithms for several values of k. (i) For k=3, we give an algorithm with approximation factor 2. This improves the best previously known factor 3. (ii) For k= 4 and k= 5, we give an algorithm with approximation factor 3. This improves the best previously known factors 4 1/6 and 4 17/30, respectively

AB - The problem of finding a minimum weight k-vertex connected spanning subgraph is considered. For k>1, this problem is known to be NP-hard. Combining properties of inclusion-minimal k-vertex connected graphs and of k-out-connected graphs (i.e., graphs which contain a vertex from which there are k internally vertex-disjoint paths to every other vertex), we derive polynomial time approximation algorithms for several values of k. (i) For k=3, we give an algorithm with approximation factor 2. This improves the best previously known factor 3. (ii) For k= 4 and k= 5, we give an algorithm with approximation factor 3. This improves the best previously known factors 4 1/6 and 4 17/30, respectively

UR - http://www.scopus.com/inward/record.url?scp=84957609587&partnerID=8YFLogxK

U2 - 10.1007/3-540-62592-5_57

DO - 10.1007/3-540-62592-5_57

M3 - Conference contribution

AN - SCOPUS:84957609587

SN - 3540625925

SN - 9783540625926

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 13

EP - 24

BT - Algorithms and Complexity - 3rd Italian Conference, CIAC 1997, Proceedings

A2 - Bongiovanni, Giancarlo

A2 - Bovet, Daniel Pierre

A2 - Di Battista, Giuseppe

PB - Springer Verlag

Y2 - 12 March 1997 through 14 March 1997

ER -