Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

An efficient heuristic is presented for the problem of finding a minimum-size k-connected
spanning subgraph of an (undirected or directed) simple graph G=(V, E). There are four …

In the survivable networkdesign problem (SNDP), the goal is to find a minimum-cost
spanning subgraph satisfying certain connectivity requirements. We study the vertex …

When both the difference between two quantities and their individual values can be
measured or computationally predicted, multiple quantities can be determined from the …

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 …

We present two new results about vertex and edge fault-tolerant spanners in Euclidean
spaces. We describe the first construction of vertex and edge fault-tolerant spanners having …

We present a factor 4/3 approximation algorithm for the problem of finding a minimum 2-
edge connected spanning subgraph of a given undirected multigraph. The algorithm is …

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 …

In the $ k $-edge-connected spanning subgraph ($ k $ ECSS) problem, our goal is to
compute a minimum-cost sub-network that is resilient against up to $ k $ link failures: Given …

The $2 $-Edge-Connected Spanning Subgraph problem (2-ECSS) is one of the most
fundamental and well-studied problems in the context of network design. In the problem, we …