1. The complexity of the traveling repairman problem;Afrati;Theoretical Informatics and Applications,1986
2. N. Agmon, S. Kraus, G.A. Kaminka, Multi-robot perimeter patrol in adversarial settings, in: Proceedings of the 2008 IEEE International Conference on Robotics and Automation (ICRA-2008), 2008, pp. 2339–2345.
3. N. Agmon, D. Urieli, P. Stone, Multiagent patrol generalized to complex environmental conditions, in: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI-2011), 2011, pp. 1090–1095.
4. S. Arora, G. Karakostas, Approximation schemes for minimum latency problems, in: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing (STOC-1999), 1999, pp. 688–693.
5. S. Arora, G. Karakostas, A 2+ϵ approximation algorithm for the k-MST problem, in: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-2000), 2000, pp. 754–759.