@@ -5,19 +5,20 @@ The MPSC problem searches for optimal transmission power assignments

to wireless network nodes in order to establish a connected wireless

network. Stated formally:

**Input:** A graph _G=(V,E)_ with edge weights _w:E→N_.

**Output:** Power assignments _p:V→N_ with minimum sum so that the subgraph with the vertices _V_ and edges _{{u,v}∈E|min{w({u,v})≤p(u),p(v)}}_ is connected.

**Input:** A graph G=(V,E) with edge weights w:E→N.

**Output:** Power assignments p:V→N with minimum sum so that the subgraph with the vertices V and edges { {u, v} ∈ E | min{w({u,v}) ≤ {p(u), p(v)} } is connected.

The problem is NP hard. This tool computes and optimal solution

with a running time that depends single-exponentially on the number _C_

of connected components of an _obligatory subgraph_ of the input

graph _G_, which consists of edges that can be assumed to be part

of the sought solution. If _C_ is logarithmic, the algorithm

with a running time that depends single-exponentially on the number C

of connected components of an obligatory subgraph of the input

graph G, which consists of edges that can be assumed to be part

of the sought solution. If C is logarithmic, the algorithm

thus runs in polynomial time. The algorithm is presented in

-[Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier,

Pavel V. Smirnov (2019). Parameterized algorithms for power-efficiently

connecting wireless sensor networks: Theorey and experiments.](https://arxiv.org/abs/1706.03177)

connecting wireless sensor networks: Theory and experiments.](https://arxiv.org/abs/1706.03177)

On test instances with few connected components, the algorithm

outperforms state-of-the art integer linear programming models

...

...

@@ -36,7 +37,7 @@ Just download a [Zip archive](https://gitlab.com/rvb/mpsc/repository/archive.zip

git clone https://gitlab.com/rvb/mpsc.git

```

To compile the program (you will need CMake and CPLEX), type

To compile the program (requires CMake and CPLEX), type