Author:
Dumitrescu Adrian,Tóth Csaba D.
Publisher
Springer Nature Switzerland
Reference44 articles.
1. Abrahamsen, M., Adamaszek, A., Miltzow, T.: The art gallery problem is $$\exists \mathbb{R} $$-complete. J. ACM 69(1), 4:1–4:70 (2022)
2. Absar, R., Whitesides, S.: On computing shortest external watchman routes for convex polygons. In: Proceedings 18th Canadian Conference on Computational Geometry (CCCG), Kingston, ON (2006)
3. Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discret. Appl. Math. 55(3), 197–218 (1994)
4. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)
5. Bonnet, É., Miltzow, T.: Parameterized hardness of art gallery problems. ACM Trans. Algorithms 16(4), 42:1-42:23 (2020)