Minimum Latency Tours and the k-Traveling Repairmen Problem
Given an undirected graph G=(V,E) and a source vertex s ∈ V, the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starting at s and covering all the vertices (customers) such that the sum of the latencies experienced by the customers is minimum. Latency of a customer p is defined to be the distance (time) traveled before visiting p for the first time. Previous literature on the KTR problem has considered the version of the problem in which the repairtime of a customer is assumed to be zero for latency calculations. We consider a generalization of the problem in which each customer has an associated repairtime. In this paper, we present constant factor approximation algorithms for this problem and its variants.
KeywordsApproximation Ratio Minimum Latency Total Latency Source Vertex Constant Factor Approximation Algorithm
Unable to display preview. Download preview PDF.
- 1.Archer, A., Levin, A., Williamson, D.P.: Faster approximation algorithms for the minimum latency problem. In: SODA 2003 (2003)Google Scholar
- 2.Arora, S., Karakostas, G.: A 2+epsilon approximation for the k-MST problem. In: SODA 2000 (2000)Google Scholar
- 3.Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: SODA 1994 (1994)Google Scholar
- 4.Chaudhuri, K., Godfrey, B., Rao, S., Talwar, K.: Paths, tours, and minimum latency tours. In: FOCS 2003 (2003)Google Scholar
- 5.Chekuri, C., Kumar, A.: A note on the k-traveling repairmen problem (manuscript, 2003)Google Scholar
- 6.Fakcharoenphol, J., Harrelson, C., Rao, S.: The k-traveling repairman problem. In: SODA 2003 (2003)Google Scholar
- 7.Garg, N.: A 3-approximation for the minimum tree spanning k vertices. In: FOCS 1996 (1996)Google Scholar
- 8.Goemans, M., Kleinberg, J.: An improved approximation ratio for the minimum latency problem. In: SODA 1996 (1996)Google Scholar
- 9.Gubbala, P., Pursnani, H.: Personal communication (November 2003)Google Scholar