### Abstract

We present approximation algorithms and structural results for problems in network design. We give improved approximation algorithms for finding rain-cost k-outconnected graphs with either a single root or multiple roots for (i) uniform costs, and (ii) metric costs. The improvements are obtained by focusing on single-root k-outcormected graphs and proving (i) a version of Mader’s critical cycle theorem and (ii) an extension of a splitting off theorem by Bienstock et al.

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

Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Publisher | Springer Verlag |

Pages | 77-88 |

Number of pages | 12 |

Volume | 1444 |

ISBN (Print) | 3540647368, 9783540647362 |

DOIs | |

Publication status | Published - 1998 |

Event | International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 1998 - Aalborg, Denmark Duration: Jul 18 1998 → Jul 19 1998 |

### Publication series

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

Volume | 1444 |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 1998 |
---|---|

Country | Denmark |

City | Aalborg |

Period | 7/18/98 → 7/19/98 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*(Vol. 1444, pp. 77-88). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1444). Springer Verlag. https://doi.org/10.1007/BFb0053965

**Approximating k-outconnected subgraph problems.** / Cheriyan, Joseph; Jordán, T.; Nutov, Zeev.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).*vol. 1444, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1444, Springer Verlag, pp. 77-88, International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 1998, Aalborg, Denmark, 7/18/98. https://doi.org/10.1007/BFb0053965

}

TY - GEN

T1 - Approximating k-outconnected subgraph problems

AU - Cheriyan, Joseph

AU - Jordán, T.

AU - Nutov, Zeev

PY - 1998

Y1 - 1998

N2 - We present approximation algorithms and structural results for problems in network design. We give improved approximation algorithms for finding rain-cost k-outconnected graphs with either a single root or multiple roots for (i) uniform costs, and (ii) metric costs. The improvements are obtained by focusing on single-root k-outcormected graphs and proving (i) a version of Mader’s critical cycle theorem and (ii) an extension of a splitting off theorem by Bienstock et al.

AB - We present approximation algorithms and structural results for problems in network design. We give improved approximation algorithms for finding rain-cost k-outconnected graphs with either a single root or multiple roots for (i) uniform costs, and (ii) metric costs. The improvements are obtained by focusing on single-root k-outcormected graphs and proving (i) a version of Mader’s critical cycle theorem and (ii) an extension of a splitting off theorem by Bienstock et al.

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

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

U2 - 10.1007/BFb0053965

DO - 10.1007/BFb0053965

M3 - Conference contribution

AN - SCOPUS:0002395698

SN - 3540647368

SN - 9783540647362

VL - 1444

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

SP - 77

EP - 88

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

PB - Springer Verlag

ER -