Faster approximation algorithms for the minimum latency problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 88-96

  Archer, Aaron ^a   Williamson, David P ^b  

^a Department of Obstetrics Gynecology   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MATHEMATICAL MODELS; TREES (MATHEMATICS);

APPROXIMATION ALGORITHM; MINIMUM LATENCY PROBLEM;

TRAVELING SALESMAN PROBLEM;

EID: 0038078084     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. F. Afrati, S. Cosmadakis, C. H. Papadimitriou, G. Papageorgiou, and N. Papakostantinou. The complexity of the traveling repairman problem. Informatique Theorique et Applications, 20(1):79-87, 1986.
2. S. R. Agnihothri. A mean value analysis of the travelling repairman problem. IIE Trans., 20(2):223-229, June 1988.
3. S. Arora and G. Karakostas. Approximation schemes for minimum latency problems. In STOC 1999, 688-693.
4. S. Aroa and G. Karakostas. A 2 + ε approximation algorithm for the k-MST problem. In SODA 2000, 754-759.
5. S. Arya and H. Ramesh. A 2.5 factor approximation algorithm for the k-MST problem. Inform. Proc. Letters, 65(3):117-118, 1998.
6. G. Ausiello, S. Leonardi, and A. Marchetti-Spaccamela. On salesmen, repairmen, spiders and other traveling agents. In Proc. of the Italian Conference on Algorithms and Complexity 2000, 1-16.
7. I. Averbakh and O. Berman. Sales-delivery man problems on treelike networks. Networks, 25:45-58, 1995.
8. L. Bianco, A. Mingozzi, and S. Ricciardelli. The traveling salesman problem with cumulative costs. Networks, 23(2):81-91, 1993.
9. A. Blum, P. Chalasani, D. Coppersmith, B. Pulleyblank, P. Raghavan, and M. Sudan. The minimum latency problem. In STOC 1994, 163-171.
10. F. Chudak, T. Roughgarden, and D. P. Williamson. Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation. In IPCO 2001, 60-70.
11. J. Fakcharoenphol, C. Harrelson, and S. Rao. The k-traveling repairman problem. In SODA 2003.
12. E. Feuerstein and L. Stougie. On-line single-server dial-a-ride problems. Theoretical Comp. Sci., 268(1):91-105, 2001.
13. M. Fischetti, G. Laporte, and S. Martello. The delivery man problem and cumulative matroids. Operations Research, 41:1065-1064, 1993.
14. F. V. Fomin and A. Lingas. Approximation algorithms for time-dependent orienteering. Inform. Proc. Letters, 83:57-62, 2002.
15. H. N. Gabow and S. Pettie. The dynamic vertex minimum problem and its application to clustering-type approximation algorithms. In Scandinavian Workshop on Algorithm Theory 2002, 190-199.
16. N. Garg. A 3-approximation for the minimum tree spanning k vertices. In FOCS 1996 302-309.
17. N. Garg. Personal communication, 1999.
18. M. Goemans and J. Kleinberg. An improved approximation ratio for the minimum latency problem. Math. Prog., 82:111-124, 1998.
19. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comp., 24:296-317, 1995.
20. E. Koutsoupias, C. H. Papadimitriou, and M. Yannakakis. Searching a fixed graph. In ICALP 1996, 280-289.
21. S. O. Krumke, W. E. de Paepe, D. Poensgen, and L. Stougie. News from the online traveling repairman. In International Symp. on Math. Foundations of Comp. Sci. 2001, 487-499.
22. A. Lucena. Time-dependent traveling salesman problem - the deliveryman case. Networks, 20(6):753-763, 1990.
23. E. Minieka. The delivery man problem on a tree network. Annals of Operations Research, 18:261-266, 1989.
24. C. H. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. Math. of Operations Research, 18:1-11, 1993.
25. J.-C. Picard and M. Queyranne. The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Operations Research, 26:86-110, 1978.
26. S. Sahni and T. Gonzalez. P-complete approximation problems. J. ACM, 23:555-565, 1976.
27. D. Simchi-Levi and O. Berman. Minimizing the total flow time of n jobs on a network. IIE Trans., 23(3):236-244, Sept 1991.
28. R. Sitters. The minimum latency problem is NP-hard for weighted trees. In IPCO 2002, 230-239.
29. J. N. Tsitsiklis. Special cases of traveling salesman and repairman problems with time windows. Networks, 22:263-282, 1992.
30. R. J. Vander Wiel and N. V. Sahinidis. Heuristic bounds and test problem generation for the time-dependent traveling salesman problem. Transportation Sci., 29(2):167-183, May 1995.
31. R. J. Vander Wiel and N. V. Sahinidis. An exact solution approach for the time-dependent traveling-salesman problem. Naval Research Logistics, 43:797-820, 1996.
32. I. R. Webb. Depth-first solutions for the deliveryman problem on tree-like networks: an evaluation using a permutation model. Transportation Sci., 30(2):134-147, May 1996.
33. B. Wu. Polynomial time algorithms for some minimum latency problems. Inform. Proc. Letters, 75:225-229, 2000.
34. C. Yang. A dynamic programming algorithm for the travelling repairman problem. Asia-Pacific J. Operations Research, 6:192-206, 1989.