The k-traveling repairmen problem

We consider the k-traveling repairmen problem, also known as the minimum latency problem, to multiple repairmen. We give a polynomial-time 8.497-approximation algorithm for this generalization, whe...