Clearing Connections by Few Agents

• We study the problem of clearing connections by agents placed at some vertices in a directed graph. The agents can move only along directed paths. The objective is to minimize the number of agents guaranteeing that any pair of vertices can be connected by a underlying undirected path that can be cleared by the agents. We provide several results on the hardness, approximability and parameterized complexity of the problem. In particular, we show it to be: NP-hard, 2-approximable in polynomial-time, and solvable exactly in O(alpha n^3 2^{2alpha}) time, where alpha is the number of agents in the solution. In addition, we give a simple linear-time algorithm optimally solving the problem in digraphs whose underlying graphs are trees. Finally, we discuss a related problem, where the task is to clear with a minimum number of agents a subgraph of the underlying graph containing its spanning tree. We show that this problem also admits a 2-approximation in polynomial time.

Ämnesord

MEDICIN OCH HÄLSOVETENSKAP  -- Medicinska och farmaceutiska grundvetenskaper -- Läkemedelskemi (hsv//swe)

MEDICAL AND HEALTH SCIENCES  -- Basic Medicine -- Medicinal Chemistry (hsv//eng)

Nyckelord

Clearing Paths

NP-hardness

Parameterized Complexity

Approximation Algorithms

clearing paths

NP-hardness

approximation

parametrized complexity

Publikations- och innehållstyp

ref (ämneskategori)

kon (ämneskategori)