SCHEDULING TWO SALESMEN IN A NETWORK
William F. Klostermeyer · International Journal of Foundations of Computer Science · 1996
The two-server problem is concerned with the movement of two servers to request points in a metric space. We consider an offline version of the problem in a graph in which the requests may be served in any order. A family of approximations algorithms is developed for this NP-complete problem.