Approximating k-outconnected subgraph problems

Joseph Cheriyan, T. 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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages77-88
Number of pages12
Volume1444
ISBN (Print)3540647368, 9783540647362
DOIs
Publication statusPublished - 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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Subgraph
Approximation algorithms
Approximation Algorithms
Costs
Roots
Multiple Roots
Network Design
Graph in graph theory
Theorem
Rain
Cycle
Metric

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Cheriyan, J., Jordán, T., & Nutov, Z. (1998). Approximating k-outconnected subgraph problems. In 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.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1444 Springer Verlag, 1998. p. 77-88 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1444).

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

Cheriyan, J, Jordán, T & Nutov, Z 1998, Approximating k-outconnected subgraph problems. in 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
Cheriyan J, Jordán T, Nutov Z. Approximating k-outconnected subgraph problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1444. Springer Verlag. 1998. p. 77-88. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0053965
Cheriyan, Joseph ; Jordán, T. ; Nutov, Zeev. / Approximating k-outconnected subgraph problems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1444 Springer Verlag, 1998. pp. 77-88 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{94991642b80f4d85a55bb30a4a04a21e,
title = "Approximating k-outconnected subgraph problems",
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.",
author = "Joseph Cheriyan and T. Jord{\'a}n and Zeev Nutov",
year = "1998",
doi = "10.1007/BFb0053965",
language = "English",
isbn = "3540647368",
volume = "1444",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "77--88",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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 -