1. Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems;Arora;J. ACM,1996
2. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems;Awerbuch,1987
3. The full degree spanning tree problem;Bhatia,1999
4. Genetic Algorithms and The Traveling Salesman Problem, Ph.D. thesis;Bryant,2000
5. Dynamic vehicle routing for data gathering in wireless networks;Celik,2010