## Abstract

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

Original language | English |
---|---|

Title of host publication | Algorithms and Complexity - 3rd Italian Conference, CIAC 1997, Proceedings |

Editors | Giancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Di Battista |

Publisher | Springer Verlag |

Pages | 13-24 |

Number of pages | 12 |

ISBN (Print) | 3540625925, 9783540625926 |

DOIs | |

State | Published - 1997 |

Externally published | Yes |

Event | 3rd Italian Conference on Algorithms and Complexity, CIAC 1997 - Rome, Italy Duration: 12 Mar 1997 → 14 Mar 1997 |

### Publication series

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

Volume | 1203 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

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

Country/Territory | Italy |

City | Rome |

Period | 12/03/97 → 14/03/97 |

### Bibliographical note

Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1997.