How Many People Can Hide in a Terrain?
How many people can hide in a given terrain, without any two of them seeing each other? We are interested in finding the precise number and an optimal placement of people to be hidden, given a terrain with n vertices. In this paper, we show that this is not at all easy: The problem of placing a maximum number of hiding people is almost as hard to approximate as the Maximum Clique problem, i.e., it cannot be approximated by any polynomial-time algorithm with an approximation ratio of nε for some ε > 0, unless P = NP. This is already true for a simple polygon with holes (instead of a terrain). If we do not allow holes in the polygon, we show that there is a constant ε > 0 such that the problem cannot be approximated with an approximation ratio of 1 + ε.
KeywordsApproximation Ratio Maximum Clique Truth Assignment Simple Polygon Maximum Cardinality
Unable to display preview. Download preview PDF.
- 1.S. Arora and C. Lund; Hardness of Approximations; in: Approximation Algorithms for NP-Hard Problems (ed. Dorit Hochbaum), PWS Publishing Company, pp. 399–446, 1996.Google Scholar
- 3.P. Crescenzi, V. Kann; A Compendium of NP Optimization Problems; in the book by G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi, Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties, Springer-Verlag, Berlin, 1999; also available in an online-version at: http://www.nada.kth.se/theory/compendium/compendium.html. Google Scholar
- 4.S. Eidenbenz, C. Stamm, and P. Widmayer; Inapproximability of some Art Gallery Problems; Proc. 10th Canadian Conf. Computational Geometry, pp. 64–65, 1998.Google Scholar
- 5.S. Eidenbenz, C. Stamm, and P. Widmayer; Positioning Guards at Fixed Height above a Terrain-An Optimum Inapproximability Result; Lecture Notes in Computer Science, Vol. 1461 (ESA’98), p. 187–198, 1998.Google Scholar
- 6.S. Eidenbenz; Inapproximability Results for Guarding Polygons without Holes; Lecture Notes in Computer Science, Vol. 1533 (ISAAC’98), p. 427–436, 1998.Google Scholar
- 7.J. Hastad; Clique is Hard to Approximate within n1-_; Proc. of the Symposium on Foundations of Computer Science, 1996.Google Scholar
- 8.M. van Kreveld; Digital Elevation Models and TIN Algorithms; in Algorithmic Foundations of Geographic Information Systems (ed. van Kreveld et al.), LNCS tutorial vol. 1340, pp. 37–78, Springer, 1997.Google Scholar
- 9.D. T. Lee and A. K. Lin; Computational Complexity of Art Gallery Problems; IEEE Trans. Info. Th, pp. 276–282, IT-32, 1986.Google Scholar
- 11.C.H. Papadimitriou; Computational Complexity; Addison-Wesley Publishing Company, 1994.Google Scholar
- 13.T. Shermer; Recent results in Art Galleries; Proc. of the IEEE, 1992Google Scholar
- 14.J. Urrutia; Art Gallery and Illumination Problems; in Handbook on Computational Geometry, edited by J.-R. Sack and J. Urrutia, 1998.Google Scholar