Skip to main content

An improved approximation ratio for the minimum latency problem

Abstract

Given a tour visitingn points in a metric space, thelatency of one of these pointsp is the distance traveled in the tour before reachingp. Theminimum latency problem (MLP) asks for a tour passing throughn given points for which the total latency of then points is minimum; in effect, we are seeking the tour with minimum average “arrival time”. This problem has been studied in the operations research literature, where it has also been termed the “delivery-man problem” and the “traveling repairman problem”. The approximability of the MLP was first considered by Sahni and Gonzalez in 1976; however, unlike the classical traveling salesman problem (TSP), it is not easy to give any constant-factor approximation algorithm for the MLP. Recently, Blum et al. (A. Blum, P. Chalasani, D. Coppersimith, W. Pulleyblank, P. Raghavan, M. Sudan, Proceedings of the 26th ACM Symposium on the Theory of Computing, 1994, pp. 163–171) gave the first such algorithm, obtaining an approximation ratio of 144. In this work, we develop an algorithm which improves this ratio to 21.55; moreover, combining our algorithm with a recent result of Garg (N. Garg, Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996, pp. 302–309) provides an approximation ratio of 10.78. The development of our algorithm involves a number of techniques that seem to be of interest from the perspective of the TSP and its variants more generally. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

This is a preview of subscription content, access via your institution.

References

  1. A. Blum, P. Chalasani, D. Coppersmith, W. Pulleyblank, P. Raghavan, M. Sudan, The minimum latency problem, Proceedings of the 26th ACM Symposium on the Theory of Computing, 1994, pp. 163–171.

  2. E. Minieka, The delivery man problem on a tree network, Annals of Operations Research 18 (1989) 261–266.

    Google Scholar 

  3. J. Tsitsiklis, Special cases of the traveling salesman and repairman problems with time windows, Networks 22 (1992) 263–282.

    Google Scholar 

  4. S. Sahni, T. Gonzalez, P-complete approximation problems, Journal of the ACM 23 (1976) 555–565.

    Google Scholar 

  5. N. Garg, A 3-approximation for the minimum tree spanningk vertices, Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996, pp. 302–309.

  6. F. Afrati, S. Cosmadakis, C. Papadimitriou, G. Papageorgiou, N. Papakostantinou, The complexity of the traveling repairman problem, Informatique Théorique et Applications 20 (1986) 79–87.

    Google Scholar 

  7. M. Fischetti, G. Laporte, S. Martello, The delivery man problem and cumulative matroids, Operations Research 41 (1993) 1055–1064.

    Google Scholar 

  8. R. Baeza-Yates, J. Culberson, G. Rawlins, Searching in the plane, Information and Computation 106 (1993) 234–252.

    Google Scholar 

  9. M. Goemans, D. Williamson, A general approximation technique for constrained forest problems, SIAM Journal on Computing 24 (1995) 296–317.

    Google Scholar 

  10. A. Blum, R. Ravi, S. Vempala, A constant-factor approximation for thek-MST problem, Proceedings of the 28th ACM Symposium on the Theory of Computing, 1996, pp. 442–448.

  11. D. Bienstock, M. Goemans, D. Simchi-Levi, D. Williamson, A note on the prize-collecting traveling salesman problem, Mathematical Programming 59 (1993) 413–420.

    Google Scholar 

  12. M. Goemans, D. Bertsimas, Survivable networks, linear programming relaxations and the parsimonious property, Mathematical Programming 60 (1993) 145–166.

    Google Scholar 

  13. L. Wolsey, Heuristic analysis, linear programming, and branch and bound, Mathematical Programming Study 13 (1980) 121–134.

    Google Scholar 

  14. D. Shmoys, D. Williamson, Analyzing the Held-Karp TSP bound: A monotonicity property with application, Information Processing Letters 35 (1990) 281–285.

    Google Scholar 

  15. A. Blum, P. Chalasani, S. Vempala, A constant-factor approximation for thek-MST problem in the plane, Proceedings of the 27th ACM Symposium on the Theory of Computing, 1995, pp. 294–302.

  16. B. Awerbuch, Y. Azar, A. Blum, S. Vempala, Improved approximation guarantees for minimum-weightk-trees and prize-collecting salesmen, Proceedings of the 27th ACM Symposium on the Theory of Computing, 1995, pp. 277–283.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Supported by NSF contract 9302476-CCR and an NEC research grant.

Author supported by an ONR Graduate Fellowship.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Goemans, M., Kleinberg, J. An improved approximation ratio for the minimum latency problem. Mathematical Programming 82, 111–124 (1998). https://doi.org/10.1007/BF01585867

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01585867

Keywords

  • Approximation algorithms
  • Minimum latency problem
  • Traveling repairman problem
  • Traveling salesman problem