## Abstract

For a given undirected (edge) weighted graph (G=(V,E)), a terminal set (S ⊂ V) and a root (r ∈ S), the rooted (k)-vertex connected minimum Steiner network (kVSMN_{r}) problem requires to construct a minimum-cost subgraph of (G) such that each terminal in S\{r} is (k)-vertex connected to (r). As an important problem in survivable network design, the (kVSMN _{r}) problem is known to be NP-hard even when (k=1). For (k=3) this paper presents a simple combinatorial eight-approximation algorithm, improving the known best ratio 14 of Nutov. Our algorithm constructs an approximate (3VSMN_{r}) through augmenting a two-vertex connected counterpart with additional edges of bounded cost to the optimal. We prove that the total cost of the added edges is at most six times of the optimal by showing that the edges in a (3VSMN_{r}) compose a subgraph containing our solution in such a way that each edge appears in the subgraph at most six times.

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

Article number | 6235951 |

Pages (from-to) | 1684-1693 |

Number of pages | 10 |

Journal | IEEE Transactions on Computers |

Volume | 62 |

Issue number | 9 |

DOIs | |

Publication status | Published - 2013 |

Externally published | Yes |

## Keywords

- Approximation algorithm
- Rooted three-vertex connectivity
- Steiner minimum network
- Survivable network design