1. Arora S (1998) Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J Assoc Comput Mach 45(5):753–782
2. Arora S (2003) Approximation schemes for NP-hard geometric optimization problems: a survey. Math Program Ser B 97:43–69
3. Arora S, Grigni M, Karger D, Klein P, Woloszyn A (1998) A polynomial time approximation scheme for weighted planar graph TSP. In: Proceedings of the 9th annual ACM-SIAM symposium on discrete algorithms (SODA), San Francisco, pp 33–41
4. Arora S, Karakostas G (1999) Approximation schemes for minimum latency problems. In: Proceedings of the 31st annual ACM symposium on theory of computing (STOC), Atlanta, pp 688–693
5. Arora S, Raghavan P, Rao S (1998) Approximation schemes for Euclidean k-medians and related problems. In: Proceedings of the 30th annual ACM symposium on theory of computing (STOC), Dallas, pp 106–113