In wireless sensor networks (WSNs) nodes often operate unattended in a collaborative
manner to perform some tasks. In many applications, the network is deployed in harsh …

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

Existing work on placing additional relay nodes in wireless sensor networks to improve
network connectivity typically assumes homogeneous wireless sensor nodes with an …

Wireless sensor network (WSN) applications, especially those serving in inhospitable
environments such as battlefield reconnaissance, are susceptible to large-scale damage …

The Steiner tree problem is one of the most important combinatorial optimization problems. It
has a long history that can be traced back to the famous mathematician Fermat (1601-1665) …

Sensors typically use wireless transmitters to com-municate with each other. However,
sensors may be located in a way that they cannot even form a connected network (eg, due to …

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

The survivable network design problem (SNDP) is the following problem: given an
undirected graph and values rij for each pair of vertices i and j, find a minimum-cost …

In the Survivable Network Design problem (SNDP), we are given an undirected graph G (V,
E) with costs on edges, along with a connectivity requirement r (u, v) for each pair u, v of …

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 …