Improved approximation algorithms for some min-max and minimum cycle cover problems

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Sanjeev Arora · Journal of the ACM · 1998 · 1.1K citations · Full text

Computing, Computer Science, Mathematics +17

Approximation Algorithms for Some Routing Problems

Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim · SIAM Journal on Computing · 1978 · 420 citations

Computing, Computer Science, Algorithms +16

Routing for Relief Efforts

Ann Melissa Campbell, Dieter Vandenbussche, William J. Hermann · Transportation Science · 2008 · 407 citations

Natural Sciences, Disaster Planning, Operations Management +17

Approximations for minimum and min-max vehicle routing problems

Esther M. Arkin, Refael Hassin, Asaf Levin · Journal of Algorithms · 2005 · 158 citations

Natural Sciences, Mathematics, Operations Management +12

Min–max tree covers of graphs

Guy Even, Naveen Garg, Jochen Könemann et al. · Operations Research Letters · 2004 · 124 citations

Natural Sciences, Computer Science, Mathematics +13