We consider various multi-vehicle versions of the minimum latency problem. There is a fleet of k<lb>vehicles located at one or more depot nodes, and we seek a collection of routes for these vehicles that<lb>visit all nodes so as to minimize the total latency incurred, which is the sum of the client waiting times.<lb>We obtain an 8.497-approximation for the… (More)