The k-traveling repairman problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 655-664

  Fakcharoenphol, Jittat ^a   Harrelson, Chris ^a   Rao, Satish ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; RANDOM PROCESSES; THEOREM PROVING; TRAVELING SALESMAN PROBLEM;

APPROXIMATION ALGORITHM; K-TRAVELING SALESMAN PROBLEM;

ALGORITHMS;

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

References (14)

1. 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), 1999.
2. S. Arora and G. Karakostas. A 2+epsilon approximation for the κ-MST problem. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000.
3. T. Asano, N. Katoh, H. Tamaki, and T. Tokuyama. Covering points in the plane by κ-tours: towards a polynomial time approximation scheme for general κ. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing (STOC), pages 275-283, 1997.
4. A. Archer and D. Williamson. Faster approximation algorithms for the minimum latency problem (to appear). In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003.
5. A. Blum, P. Chalasani, D. Coppersmith, B. Pulleyblank, P. Raghavan, and M. Sudan. The minimum latency problem. In Proceedings of the twenth-sixth annual ACM symposium on Theory of computing (STOC), pages 163-171, 1994.
6. C. Chekuri, A. Gupta, A. Kumar, S. Naor, and D. Raz. Building edge-failure resilient networks. In Integer Programming and Combinatorial Optimization (IPCO), pages 439-456, 2002.
7. N. Christofides. The Traveling Salesman Problem, pages 431-448. John Wiley & Sons, 1985.
8. M. Charikar, S. Khuller, and B. Raghavachari. Algorithms for capacitated vehicle routing. SIAM Journal on Computing, 31(3):665-682, 2001. (Conference version in STOC 1998).
9. N. Garg. A 3-approximation for the minimum tree spanning k vertices. In Proceedings of the 37th Annual Symposium Foundations of Computer Science (FOCS), pages 302-309, 1996.
10. 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 (SODA), 1996.
11. M. Haimovich, A.H.G. Rinnooy Kan, and L. Stougie. Vehicle Routing: Methods and Studies, chapter 3: Elsevier Science Pub. Co., 1988.
12. S. Sahni and T. Gonzales. P-complete approximation problems. Journal of the ACM, 23(3):555-565, 1976.
13. R. Sitters. The minimum latency problem is np-hard for weighted trees. In Proceedings of the Ninth conference on Integer Programming and Combinatorial Optimization, pages 230-239, 2002.
14. P. Toth and D. Vigo, editors. The Vehicle Routing Problem. SIAM monographs on discrete mathematics and applications. Society for Industrial and Applied Mathematics, 2002.