An improved approximation algorithm for the clustered traveling salesman problem

Combinatorial optimization: Theory and algorithms

Computers & Mathematics with Applications · 2001 · 610 citations

Natural Sciences, Computer Science, Mathematics +12

Analysis of Christofides' heuristic: Some paths are more difficult than cycles

J.A. Hoogeveen · Operations Research Letters · 1991 · 195 citations

Computing, Mathematics, Algorithms +3

Approximation Algorithms for Some Postman Problems

Greg N. Frederickson · Journal of the ACM · 1979 · 179 citations · Full text

Computing, Computer Science, Algorithms +4

Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem

Nili Guttmann‐Beck, Refael Hassin, Samir Khuller et al. · Algorithmica · 2000 · 90 citations

Computing, Computer Science, Algorithms +9