Mikael Hammar, Bengt J. Nilsson. Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms. In Bogdan S. Chlebus, Ludwik Czaja, editors, Fundamentals of Computation Theory, 11th International Symposium, FCT 97, Kraków, Poland, September 1-3, 1997, Proceedings. Volume 1279 of Lecture Notes in Computer Science, pages 210-221, Springer, 1997.
Abstract is missing.