Let us start with two examples. A company has a machine which drills holes into printed
circuit boards. Since it produces many of these boards it wants the machine to complete one …

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 …

We give approximation algorithms for the Survivable Network problem. The input consists of
a graph G=(V, E) with edge/node-costs, a node subset S⊆ V, and connectivity requirements …

Consider the edge-connectivity survivable network design problem: given a graph G=(V, E)
with edge-costs, and edge-connectivity requirements rij for every pair of vertices i, j, find an …

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 …

We consider two cases of the Survivable Network Design (SND) problem: given a complete
graph Gn=(V, En) with costs on the edges and connectivity requirements {r (u, v): u, v∊ V} …

We survey approximation algorithms and hardness of approximation results for the
Survivable Network problem in which we seek a low edge-cost directed/undirected …

A subset T⊆ V of terminals is k-connected to a root s in a directed/undirected graph J if J has
k internally-disjoint vs-paths for every v∈ T; T is k-connected in J if for every s∈ T the set …

The group Steiner problem is a classical network design problem where we are given a
graph and a collection of groups of vertices, and want to build a min-cost subgraph that …