Paths, trees, and minimum latency tours

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2003-January, Issue , 2003, Pages 36-45

  Chaudhuri, K ^a   Godfrey, B ^a   Rao, S ^a   Talwar, K ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation algorithms; Computer science; Cost function; Delay; Educational institutions; Equations; Minimization methods; Space exploration; Tree graphs

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; COST FUNCTIONS; FORESTRY; SPACE RESEARCH; TREES (MATHEMATICS);

DELAY; EDUCATIONAL INSTITUTIONS; EQUATIONS; MINIMIZATION METHODS; SPACE EXPLORATIONS; TREE GRAPH;

APPROXIMATION ALGORITHMS;

EID: 84943416195     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238179     Document Type: Conference Paper

References (36)

1. F. Afrati, S. Cosmadakis, C. Papadimitriou, G. Papageorgiou, and N. Papakonstantinou. The complexity of the traveling repairman problem. Theoretical Informatics and Applications, 20:79-87, 1986.
2. S. R. Agnihothri. A mean value analysis of the travelling repairman problem. IIE Transactions, 20(2):223-229, June 1988.
3. A. Archer, A. Levin, and D. Williamson. Faster approximation algorithms for the minimum latency problem. Manuscript, 2003.
4. S. Arora and G. Karakostas. Approximation schemes for minimum latency problems. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing (STOC'99), pages 688-693, New York, May 1999. Association for Computing Machinery.
5. S. Arora and G. Karakostas. A (2 + ε) approximation algorithm for the k-MST problem. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 754-759, N.Y., Jan. 9-11 2000. ACM Press.
6. G. Ausiello, S. Leonardi, and A. Marchetti-Spaccamela. On salesmen, repairmen, spiders, and other traveling agents. Lecture Notes in Computer Science, 1767, 2000.
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: Networks: An International Journal, 23, 1993.
9. A. Blum, P. Chalasani, D. Coppersmith, B. Pulleyblank, P. Raghavan, and M. Sudan. The minimum latency problem. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 163-171, Montréal, Québec, Canada, 23-25 May 1994.
10. A. Blum, S. Chawla, D. Karger, T. Lane, A. Meyerson, and M. Minkoff. Approximation algorithms for orienteering and discounted-reward TSP. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.
11. A. Blum, R. Ravi, and S. Vempala. A constant-factor approximation algorithm for the k-MST problem. In Proceedings of The Twenty-Eighth Annual ACM Symposium On The Theory Of Computing (STOC '96), pages 442-448, New York, USA, May 1996. ACM Press.
12. C. Chekuri and A. Kumar. Maximum coverage problem with group budget constraints and applications. Submitted, 2003.
13. F. A. Chudak, T. Roughgarden, and D. P. Williamson. Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation. Lecture Notes in Computer Science, 2081, 2001.
14. J. Fakcharoenphol, C. Harrelson, and S. Rao. The k-traveling repairman problem. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. ACM/SIAM, Jan. 12-14 2003.
15. U. Feige, L. Lovász, and P. Tetali. Approximating minsum set cover. Lecture Notes in Computer Science: Proceedings of the 5th APPROX, 2462:94-107, 2002.
16. E. Feuerstein and L. Stougie. On-line single-server dial-a-ride problems. Theoretical Computer Science, 268(1):91-105, Oct. 2001.
17. M. Fischetti, G. Laporte, and S. Martello. The delivery man problem and cumulative matroids. Operations Research, 41:1065-1064, 1993.
18. H. Gabow and S. Pettie. The dynamic vertex minimum problem and its application to clustering-type approximation algorithms. In Proceedings 8th Scandinavian Workshop on Algorithm Theory (SWAT'02), LNCS, pages 190-199, 2002.
19. H. N. Gabow and S. Pettie. The dynamic vertex minimum problem and its application to clustering-type approximation algorithms. In M. Penttonen and E. M. Schmidt, editors, SWAT 2002, volume 2368 of LNCS, pages 190-199. Springer, 2002.
20. N. Garg. A 3-approximation for the minimum tree spanning k vertices. In 37th Annual Symposium on Foundations of Computer Science, pages 302-309, Burlington, Vermont, 14-16 Oct. 1996. IEEE.
21. M. Goemans and J. Kleinberg. An improved approximation ratio for the minimum latency problem. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 152-158, New York/Philadelphia, Jan. 28-30 1996. ACM/SIAM.
22. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24(2):296-317, Apr. 1995.
23. E. Koutsoupias, C. Papadimitriou, and M. Yannakakis. Searching a fixed graph. In Proceedings of the 23rd International Colloquium on Automata, Languages and Programming, pages 280-289. Springer-Verlag, 1996.
24. S. O. Krumke, W. E. de Paepe, D. Poensgen, and L. Stougie. News from the online traveling repairman. Lecture Notes in Computer Science, 2136, 2001.
25. A. Lucena. Time-dependent traveling salesman problem-the deliveryman case. NETWORKS: Networks: An International Journal, 20, 1990.
26. E. Minieka. The delivery man problem on a tree network. Annals of Operations Research, 18(1-4):261-266, February 1989.
27. C. H. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. Mathematics of Operations Research, 18:1-11, 1993.
28. S. Sahni and T. Gonzales. P-complete problems and approximate solutions. In 15th Annual Symposium on Switching and Automata Theory, pages 28-32, The University of New Orleans, 14-16 Oct. 1974. IEEE.
29. D. Simchi-Levi and O. Berman. Minimizing the total flow time of n jobs on a network. IIE Trans., 23(3):236-244, September 1991.
30. R. Sitters. The minimum latency problem is NP-hard for weighted trees. In IPCO: 9th Integer Programming and Combinatorial Optimization Conference, 2002.
31. J. N. Tsitsiklis. Special cases of traveling salesman and repairman problems with time windows. NETWORKS: Networks: An International Journal, 22, 1992.
32. I. R. Webb. Depth-first solutions for the deliveryman problem on tree-like networks: an evaluation using a permutation model. Transportation Science, 30(2):134-147, May 1996.
33. R. J. V. Wiel and N. V. Sahinidis. Heuristic bounds and test problem generation for the time dependent traveling salesman problem. Transportation Science, 29(2):167-183, May 1995.
34. T. Will. Extremal Results and Algorithms for Degree Sequences of Graphs. PhD thesis, U. of Illinois at Urbana-Champaign, 1993.
35. B. Y. Wu. Polynomial time algorithms for some minimum latency problems. Information Processing Letters, 75(5):225-229, Oct. 2000.
36. C. Yang. A dynamic programming algorithm for the travelling repairman problem. Asia-Pacific J. Operations Research, 6(10):192-206, 1989.