Title:

Activation network problems

Network design problems traditionally are modelled by a graph where each edge (or node) has a fixed cost. We investigate optimization problems in a realistic model for wireless network design called activation network. The activation network setting can be defined as follows. We are given a directed or undirected graph G = (V, E) together with a family {fuv : (u, v) E E} of monotone nondecreasing activation functions from D² to {0, 1}, where D is a constantsize subset of the nonnegative real numbers, such that the activation of an edge depends on the chosen values from the domain D at its endpoints. An edge (u, v) E E is activated for chosen values xᵤ and xᵥ if fᵤᵥ(xᵤ, xᵥ) = 1, and the activation function fᵤᵥ is called monotone nondecreasing if fᵤᵥ (xᵤ, xᵥ) = 1 implies fᵤᵥ (yᵤ, yᵥ) = 1 for any yᵤ ≥ xᵤ, yᵥ ≥ xᵥ. The objective of activation network problems is to find activation values xᵥ E E for all v E V such that the total activation cost ∑ᵥEᵥ xᵥ is minimized and the activated set of edges satisfies some connectivity requirements. We give a 1:5approximation algorithm for the minimum activation cost of k nodedisjoint stpaths (stMANDP) when k = 2. We also show that a papproximation algorithm for the stMANDP problem implies a papproximation algorithm for solving the minimum activation cost of k edgedisjoint stpaths (stMAEDP) problem when k = 2. We propose polynomial time algorithms that optimally solve the stMANDP, stMAEDP, minimum activation Steiner tree and the problem of finding minimum activation cost nodedisjoint paths between k disjoint terminal pairs for graphs with treewidth bounded by a constant. We also study the stMANDP, stMAEDP, minimum spanning activation tree and minimum activation arborescence problems for the special case where D = 2 and all edges have the same activation function.
