Approximation Algorithms for Movement Repairmen

Abstract

In the Movement Repairmen (MR) problem, we are given a metric space ( V , d ) along with a set R of k repairmen r 1 , r 2 , …, r k with their start depots s 1 , s 2 , …, s k ∈ V and speeds v 1 , v 2 , …, v k ⩾ 0, respectively, and a set C of m clients c 1 , c 2 , …, c m having start locations s ′ 1 , s ′ 2 , …, s ′ m ∈ V and speeds v ′ 1 , v ′ 2 , …, v ′ m ⩾ 0, respectively. If t is the earliest time a client c j is collocated with any repairman (say, r i ) at a node u , we say that the client is served by r i at u and that its latency is t . The objective in the (S um -MR) problem is to plan the movements for all repairmen and clients to minimize the sum (average) of the clients’ latencies. The motivation for this problem comes, for example, from Amazon Locker Delivery [Amazon 2010] and USPS gopost [Service 2010]. We give the first O (log n )-approximation algorithm for the S um -MR problem. In order to approximate S um -MR, we formulate an LP for the problem and bound its integrality gap. Our LP has exponentially many variables; therefore, we need a separation oracle for the dual LP. This separation oracle is an instance of the Neighborhood Prize Collecting Steiner Tree (NPCST) problem in which we want to find a tree with weight at most L collecting the maximum profit from the clients by visiting at least one node from their neighborhoods. The NPCST problem, even with the possibility to violate both the tree weight and neighborhood radii, is still very hard to approximate. We deal with this difficulty by using LP with geometrically increasing segments of the timeline, and by giving a tricriteria approximation for the problem. The rounding needs a relatively involved analysis. We give a constant approximation algorithm for S um -MR in Euclidean Space where the speed of the clients differs by a constant factor. We also give a constant approximation for the makespan variant.