Finding optimum k-vertex connected spanning subgraphs: Improved approximation algorithms for k=3, 4, 5

Yefim Dinitz, Zeev Nutov

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

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 languageEnglish
Title of host publicationAlgorithms and Complexity - 3rd Italian Conference, CIAC 1997, Proceedings
EditorsGiancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Di Battista
PublisherSpringer Verlag
Pages13-24
Number of pages12
ISBN (Print)3540625925, 9783540625926
DOIs
StatePublished - 1 Jan 1997
Externally publishedYes
Event3rd Italian Conference on Algorithms and Complexity, CIAC 1997 - Rome, Italy
Duration: 12 Mar 199714 Mar 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1203
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd Italian Conference on Algorithms and Complexity, CIAC 1997
Country/TerritoryItaly
CityRome
Period12/03/9714/03/97

Fingerprint

Dive into the research topics of 'Finding optimum k-vertex connected spanning subgraphs: Improved approximation algorithms for k=3, 4, 5'. Together they form a unique fingerprint.

Cite this