The minimum latency problem

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 163-171

  Blum, Avrim ^a   Chalasani, Prasad ^a   Coppersmith, Don ^b   Pulleyblank, Bill ^b   Raghavan, Prabhakar ^b   Sudan, Madhu ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; MATRIX ALGEBRA; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; OPTIMIZATION; SCHEDULING; SET THEORY;

APPROXIMATE SOLUTION; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; DISTANCE MATRICES; MINIMUM LATENCY PROBLEMS; SYMMETRIC DISTANCES; TRIANGLE INEQUALITY;

TRAVELING SALESMAN PROBLEM; ALGORITHMS;

DELIVERY MAN PROBLEMS; MINIMUM LATENCY PROBLEM; TRAVELING REPAIRMAN PROBLEM;

EID: 0027983372     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195125     Document Type: Conference Paper

References (13)

1. F. Afrati, S. Cosmadakis, C. Papadimitriou, G. Papageorgiou, N. Papakostantinou. The Complexity of the Traveling Repairman Problem. Informatique Theorique et Applications (Theoretical Informatics and Applications), Vol. 20, No. 1, pages 79-87, 1986. ALMSS.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the in-Tractability of approximation problems. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pages 14-23, 1992.
3. R. Baeza-Yates, J. Culberson and G.J. Rawlins. Searching with Uncertainty. To appear in Infor-mation and Computation.
4. D. Bienstock, M. X. Goemans, D. Simchi-Levi, and D. P. Williamson. A note on the prize col-lecting traveling salesman problem. Math. Prog., 59, 413-420, 1993.
5. L. Bianco, A. Mingozzi and S. Ricciardelli. The traveling salesman problem with cumulative costs Networks, vol.23, no.2, pages 81-91, March 1993.
6. N. Garg and D. Hochbaum. An 0(log k) approximation algorithm for the k minimum spanning tree problem in the plane. To appear in Proceedings of the 26th Annual ACM Symposium on Theory of Computing (These proceedings), 1994.
7. M. Goemans and J. Kleinberg. Personal Communication. 1994.
8. M. Goemans and D. Williamson. General approximation technique for constrained forest problems. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 307-315, 1992.
9. A. Lucena. Time-dependent traveling salesman problem -The deliveryman case. Networks, vol.20, no.6, pages 753-763, October 1990.
10. E. Minieka. The delivery man problem on a tree network. Annals of Operations Research, vol. 18, no. 1-4, pages 261-266, February 1989.
11. C. H. Papadimitriou and M. Yannakakis. Shortest paths without a map. Proc. 16th ICALP, pages 610-620, July 1989.
12. C. H. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two. In Mathematics of Operations Research, 1992. To appear.
13. R. Reynolds. Personal Communication. 1993.