Synchronization Helps Robots to Detect Black Holes in Directed Graphs
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Locating and repairing faults in a network with mobile agents
Theoretical Computer Science
Mapping an unfriendly subway system
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Time optimal algorithms for black hole search in rings
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Synchronous black hole search in directed graphs
Theoretical Computer Science
Improving the optimal bounds for black hole search in rings
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Black hole search with finite automata scattered in a synchronous torus
DISC'11 Proceedings of the 25th international conference on Distributed computing
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Asynchronous exploration of an unknown anonymous dangerous graph with o(1) pebbles
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Fault-Tolerant exploration of an unknown dangerous graph by scattered agents
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Exploring an unknown dangerous graph using tokens
Theoretical Computer Science
Hi-index | 0.00 |
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node without leaving any trace. The Black Hole Search is the task of locating all black holes in a network, through the exploration of its nodes by a set of mobile agents. In this article we consider the problem of designing the fastest Black Hole Search, given the map of the network, the starting node and a subset of nodes of the network initially known to be safe. We study the version of this problem that assumes that there is at most one black hole in the network and there are two agents, which move in synchronized steps. We prove that this problem is not polynomial-time approximable within any constant factor less than $389 \over 388$ (unless P = NP). We give a 6-approximation algorithm, thus improving on the 9.3-approximation algorithm from (Czyzowicz et al., Fundamenta Informaticae 71 (2006), 229–242). We also prove APX-hardness for a restricted version of the problem, in which only the starting node is initially known to be safe. © 2008 Wiley Periodicals, Inc. NETWORKS, 2008 Part of this work was done while E. Markou, T. Radzik and F. Sarracco were visiting the LaBRI (Laboratoire Bordelais de Recherche en Informatique) in Bordeaux.