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

We survey approximation algorithms of connectivity problems. The survey presented
describing various techniques. In the talk the following techniques and results are …

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

(MATH) We present two new algorithms for the problem of finding a minimum-cost k-vertex
connected spanning subgraph. The first algorithm works on undirected graphs with at least …

Given a graph (directed or undirected) with costs on the edges, and an integer k, we
consider the problem of finding a k-node connected spanning subgraph of minimum cost …

We study the survivable network design problem (SNDP) for vertex connectivity. Given a
graph G (V, E) with costs on edges, the goal of SNDP is to find a minimum cost subset of …

We present two new approximation algorithms for the problem of finding ak-node connected
spanning subgraph (directed or undirected) of minimum cost. The best known approximation …

In the survivable network design problem (SNDP) the goal is to find a minimum cost subset
of edges that satisfies a given set of pairwise connectivity requirements among the vertices …

We consider a fault tolerant version of the metric facility location problem in which every city,
j, is required to be connected to rj facilities. We give the first non-trivial approximation …

Given a complete undirected graph, a cost function on edges, and a degree bound B, the
degree bounded network design problem is to find a minimum cost simple subgraph with …