The (undirected) Steiner Network problem is as follows: given a graph G=(V,E) with
edge/node-weights and edge-connectivity requirements {r(u,v):u,v∈U⊆V\}, find a minimum …

In this paper we consider both the maximization variant Max Rep and the minimization
variant Min Rep of the famous Label Cover problem. So far the best approximation ratios …

Survivable network design is an important suite of algorithmic problems where the goal is to
select a minimum cost network subject to the constraint that some desired connectivity …

Topology control is one of the most important techniques used in wireless ad hoc and
sensor networks to reduce energy consumption. Algorithms for topology control attempt to …

We consider some network design problems with applications for wireless networks. The
input for these problems is a metric space (X, d) and a finite subset U⊆ X of terminals. In the …

Abstract The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power
(range) assignment to the nodes of a given wireless network such that the resulting …

Given a (directed) graph with costs on the edges, the power of a node is the maximum cost
of an edge leaving it, and the power of the graph is the sum of the powers of its nodes. Let …

In minimum power network design problems we are given an undirected graph G=(V, E) with
edge costs {ce: e∈ E}. The goal is to find an edge set F⊆ E that satisfies a prescribed …

Abstract In the Survivable Networks Activation problem we are given a graph G=(V, E), S⊆
V, a family {fuv (xu, xv): uv∈ E} of monotone non-decreasing activating functions from R+ 2 …

Given a (directed or undirected) graph with edge costs, the power of a node is the maximum
cost of an edge leaving it, and the power of the graph is the sum of the powers of its nodes …