The basic goal of survivable network design is to construct low-cost networks which
preserve a sufficient level of connectivity despite the failure or removal of a few nodes or …

A 5/4-approximation algorithm is presented for the minimum cardinality 2-edge-connected
spanning subgraph problem in undirected graphs. This improves the previous best …

We study the approximability of dense and sparse instances of the following problems: the
minimum 2-edge-connected (2-EC) and 2-vertex-connected (2-VC) spanning subgraph …

In this paper we are interested in algorithms for finding 2-factors that cover certain
prescribed edge-cuts in bridgeless cubic graphs. Since a Hamilton cycle is a 2-factor …

In this paper we study the NP-hard problem of finding a minimum size 2-edge-connected
spanning subgraph (henceforth 2EC) in cubic and subcubic multigraphs. We present a new …

Abstract Design process, operation and maintenance of telecommunication networks are
dynamically developing research areas. Graphs are often used as mathematical models of …

This paper studies the NP-hard problem of finding a minimum size 2-edge connected
spanning subgraph (2-ECSS). An algorithm is given that on an r-edge connected input …

Khuller and Raghavachari J. Algorithms, 21 (1996), pp. 434--450 present an approximation
algorithm (the KR algorithm) for finding the smallest k-edge connected spanning subgraph …

We present a new approximation algorithm for the minimum 2-edge-connected spanning
subgraph problem. Its approximation ratio is 4 3, which matches the current best ratio. The …

In this paper we investigate the problem of finding a 2-connected spanning subgraph of
minimal cost in a complete and weighted graph G. This problem is known to be APX-hard …