Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco. Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. In Andrzej Pelc, Michel Raynal, editors, Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings. Volume 3499 of Lecture Notes in Computer Science, pages 200-215, Springer, 2005. [doi]
Abstract is missing.