Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains

Stephan Eidenbenz. Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains. In Martti Penttonen, Erik Meineche Schmidt, editors, Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings. Volume 2368 of Lecture Notes in Computer Science, pages 60-68, Springer, 2002. [doi]

Abstract

Abstract is missing.