Clearing Connections by Few Agents

DSpace Repository

Clearing Connections by Few Agents

Show full item record

Files for download


Simple item record

Publication Conference Paper, peer reviewed
Title Clearing Connections by Few Agents
Author(s) Levcopoulos, Christos ; Lingas, Andrzej ; Nilsson, Bengt J. ; Zylinski, Pawel
Date 2014
Editor(s) Ferro, Alfredo; Luccio, Fabrizio; Widmayer, Peter
English abstract
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.
DOI (link to publisher's fulltext)
Publisher Springer Verlag
Host/Issue Fun with algorithms;
Series/Issue Lecture notes in computer science;8496
ISSN 0302-9743
ISBN 978-3-319-07889-2
Pages 289-300
Language eng (iso)
Subject(s) Clearing Paths
Parameterized Complexity
Approximation Algorithms
Research Subject Categories::MATHEMATICS
Note FUN 2014 Seventh International Conference on FUN WITH ALGORITHMS July 1--3, 2014, Lipari Island, Sicily, Italy
Handle (link to this page)
Link (external link to related web page)

This item appears in the following Collection(s)

Show full item record



My Account