Approximation bounds for black hole search problems

Networks

Volumn 52, Issue 4, 2008, Pages 216-226

  Klasing, Ralf ^a   Markou, Euripides ^b   Radzik, Tomasz ^c   Sarracco, Fabiano ^d  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b MCMASTER UNIVERSITY   (Canada)

^c KING'S COLLEGE LONDON   (United Kingdom)

^d SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Approximation algorithm; Black hole search; Graph exploration; Inapproximability; Mobile agent

Indexed keywords

AGENTS; APPROXIMATION ALGORITHMS; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; STARS; WIRELESS NETWORKS;

APPROXIMATION BOUNDS; BLACK HOLE SEARCH; BLACK HOLE SEARCHES; BLACK HOLES; CONSTANT FACTORS; GRAPH EXPLORATION; INAPPROXIMABILITY; STATIONARY PROCESSES;

MOBILE AGENTS;

EID: 56749159999     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20233     Document Type: Article

References (19)

1. B. Csaba, M. Karpinski, and R Krysta, Approximability of dense and sparse instances of minimum. 2-connectivity, TSP and path problems, Proc 13th Ann ACM-SIAM Symp Discr Algorithms (SODA '02), Philadelphia, PA, USA, 2002, pp. 74-83.
2. J. Czyzowicz, D. Kowalski, E. Markou, and A. Pelc, Complexity of searching for a black hole, Fundamenta Informaticae 71 (2006), 229-242.
3. J. Czyzowicz, D. Kowalski, E. Markou, and A. Pelc, Searching for a black hole in synchronous tree networks, Combin Probability Comput 16 (2007), 595-619.
4. Preliminary version under the title "Searching for a Black Hole In Tree Networks" in Proc. 8th International Conference on Principles of Distributed Systems (OPODIS 2004), Springer LNCS, Vol. 3544, 2004, pp. 67-80.
5. S. Dobrev, R Flocchini, R. Kràlovic, G. Prencipe, P. Ruzicka, and N. Santoro, Black hole search in common interconnection networks, Networks 47 (2006), 61-71.
6. Preliminary version under the title "Black Hole Search by Mobile Agents in Hypercubes and Related Networks" in Proc. 6th Int. Conf. on Principles of Distributed Systems (OPODIS 2002), 2002, pp. 169-180.
7. S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro, Searching for a black hole in arbitrary networks: Optimal mobile agents protocols, Distrib Comput 19 (2006), 1-18.
8. Preliminary version in Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), 2002, pp. 153-161.
9. S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro, Mobile search for a black hole in an anonymous ring, Algorithmica 48 (2007), 67-90.
10. Preliminary version in Proc. 15th Int. Symposium on Distributed Computing (DISC 2001), Springer LNCS, Vol. 2180, 2001, pp. 166-179.
11. L. Engebretsen and M. Karpinski, TSP with bounded metrics, J Comput System Sciences 72 (2006), 509-546.
12. F. Hohl, Time limited black box security: Protecting mobile agents from malicious hosts, Proc Conference Mobile Agent Security, Vol. 1419, of Lecture Notes in Computer Science, Springer, 1998, pp. 90-111.
13. F. Hohl, A framework to protect mobile agents by using reference states, Proc 20th Int Conference Distrib Comput Syst (ICDCS '00), 2000, pp. 410-417.
14. R. Klasing, E. Markou, T. Radzik, and F. Sarracco, Hardness and approximation results for black hole search in arbitrary graphs, Theoret Comput Sci 384 (2007), 201-221.
15. Preliminary version in Proc. 12th Int. Colloquium on Structural Information and Communication Complexity (SIROCCO 2005), Springer LNCS, Vol. 3499, 2005, pp. 200-215.
16. S. Ng and K. Cheung, Protecting mobile agents against malicious hosts by intention of spreading, Proc Int Conference Parallel Distrib Process Appl (PDPTA'99), Vol. II, 1999, pp. 725-729.
17. T. Sander and C. Tschudin, Protecting mobile agents against malicious hosts, Proc Conference Mobile Agent Security, Vol. 1419, Lecture Notes in Computer Science, Springer, 1998, pp. 44-60.
18. K. Schelderup and J. Ølnes, Mobile agent security - issues and directions, Proc 6th Int Conference Intelligence Services in Networks, Vol. 1597, Lecture Notes in Computer Science, Springer, 1999, pp. 155-167.
19. R. Seidel, On the all-pairs-shortest-path. problem in unweighted undirected graphs, J Comput System Sciences 51 (1995), 400-403.