1. S. Arora, Probabilistic checking of proofs and the hardness of approximation problems, Ph.D. Thesis, UC Berkeley, 1994
2. Hardness of Approximations;Arora,1996
3. B. Broden, M. Hammar, B.J. Nilson, Guarding lines and 2-link polygons is APX-hard, in: Proc. 13th Canadian Conf. on Computational Geometry, CCCG'01, 2001, pp. 45–48
4. S. Carlsson, H. Jonsson, Guarding a treasury, in: Proc. 5th Canadian Conf. on Computational Geometry, 1993, pp. 85–90
5. O. Cheong, A. Efrat, S. Har-Peled, On finding a guard that sees most and a shop that sells most, in: Proc. 15th ACM-SIAM Symp. on Discrete Algorithms, 2004, pp. 1098–1107