Approximating k-outconnected subgraph problems

Joseph Cheriyan, Tibor Jordàn, Zeev Nutov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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 languageEnglish
Title of host publicationApproximation Algorithms for Combinatorial Optimization - International Workshop, APPROX 1998, Proceedings
EditorsJosé Rolim, Klaus Jansen
PublisherSpringer Verlag
Pages77-88
Number of pages12
ISBN (Print)3540647368, 9783540647362
DOIs
Publication statusPublished - Jan 1 1998
EventInternational Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 1998 - Aalborg, Denmark
Duration: Jul 18 1998Jul 19 1998

Publication series

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

Other

OtherInternational Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 1998
CountryDenmark
CityAalborg
Period7/18/987/19/98

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Cheriyan, J., Jordàn, T., & Nutov, Z. (1998). Approximating k-outconnected subgraph problems. In J. Rolim, & K. Jansen (Eds.), Approximation Algorithms for Combinatorial Optimization - International Workshop, APPROX 1998, Proceedings (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