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.
|Title of host publication||Approximation Algorithms for Combinatorial Optimization - International Workshop, APPROX 1998, Proceedings|
|Editors||José Rolim, Klaus Jansen|
|Number of pages||12|
|ISBN (Print)||3540647368, 9783540647362|
|State||Published - 1998|
|Event||International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 1998 - Aalborg, Denmark|
Duration: 18 Jul 1998 → 19 Jul 1998
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 1998|
|Period||18/07/98 → 19/07/98|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.