Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Searching for a black hole in arbitrary networks: optimal mobile agent protocols
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Mobile Search for a Black Hole in an Anonymous Ring
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Mobile Agent Security - Issues and Directions
IS&N '99 Proceedings of the 6th International Conference on Intelligence and Services in Networks: Paving the Way for an Open Service Market
Time Limited Blackbox Security: Protecting Mobile Agents From Malicious Hosts
Mobile Agents and Security
Protecting Mobile Agents Against Malicious Hosts
Mobile Agents and Security
A Framework to Protect Mobile Agents by Using Reference States
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Searching for a black hole in tree networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Locating a black hole in an un-oriented ring using tokens: the case of scattered agents
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
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
Searching for a black hole in interconnected networks using mobile agents and tokens
Journal of Parallel and Distributed Computing
| 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. We consider the task of locating a black hole in a (partially) synchronous network, assuming an upper bound on the time of any edge traversal by an agent. The minimum number of agents capable to identify a black hole is two. For a given graph and given starting node we are interested in the fastest possible black hole search by two agents, under the general scenario in which some subset of nodes is safe and the black hole can be located in one of the remaining nodes. We show that the problem of finding the fastest possible black hole search scheme by two agents is NP-hard, and we give a 9.3-approximation for it.