1. Polynomial time approximation schemes for Euclidean TSP and other geometric problems;Arora,1996
2. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems;Arora,1997
3. Approximation schemes for dense instances of NP-hard problems;Arora,1995
4. Proof verification and the hardness of approximation problems;Arora;J. Assoc. Comput. Mach.,1998
5. On clustering problems with connected optima in Euclidean spaces;Boros;Discrete Math.,1989