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

Abstract The problem Min-Power k-Connectivity seeks a power assignment to the nodes in a
given wireless ad hoc network such that the produced network topology is k-connected and …

The problem of finding a minimum weight k-vertex connected spanning subgraph in a graph
G=(V, E) is considered. For k≥ 2, this problem is known to be NP-hard. Combining …

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 propose a novel geometric Rao-Blackwellized particle filtering framework for monocular
SLAM with locally planar landmarks. We represent the states for the camera pose and the …

We consider the problem of making a given (k− 1)-connected graph k-connected by adding
a minimum number of new edges, which we call the k-connectivity augmentation problem. In …

We obtain approximation ratio 4+ 2 ℓ≈ 4+ 4 lg⁡ k lg⁡ n− lg⁡ k for the (undirected) k-
Connected Subgraph problem, where ℓ=⌊ lg⁡ n− lg⁡ k+ 1 2 lg⁡ k+ 1⌋ is the largest integer …

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 …

In this paper we consider the problem of adding the smallest number of additional (relay)
nodes to a network of static nodes with limited communication range so that the induced …