Approximating the k-traveling repairman problem with repairtimes

Journal of Discrete Algorithms

Volumn 5, Issue 2 SPEC. ISS., 2007, Pages 293-303

  Jothi, Raja ^a   Raghavachari, Balaji ^b  

^a NATIONAL INSTITUTES OF HEALTH   (United States)

^b The University of Texas at Dallas   (United States)

Author keywords

Approximation algorithms; Combinatorial optimization

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; NUMBER THEORY; NUMERICAL METHODS; PROBLEM SOLVING;

BOUNDED-LATENCY PROBLEM; K-TRAVELING REPAIRMAN (KTR) PROBLEM; LATENCY BOUND; LATENCY CALCULATIONS;

GRAPH THEORY;

EID: 34247126867     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2006.03.023     Document Type: Article

References (14)

1. A. Archer, A. Levin, D.P. Williamson, Faster approximation algorithms for the minimum latency problem, in: Proc. 14th Symposium on Discrete Algorithms (SODA), 2003, pp. 88-96
2. A. Blum, P. Chalasani, D. Coppersmith, B. Pulleyblank, P. Raghavan, M. Sudan, The minimum latency problem, in: Proc. 26th Symposium on Theory of Computing (STOC), 1994, pp. 163-171
3. K. Chaudhuri, B. Godfrey, S. Rao, K. Talwar, Paths, tours, and minimum latency tours, in: Proc. 44th IEEE Symposium on Foundations of Computer Science (FOCS), 2003, pp. 36-45
4. C. Chekuri, A. Kumar, Maximum coverage problem with group budget constraints, in: Proc. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2004, pp. 72-83
5. J. Fakcharoenphol, C. Harrelson, S. Rao, The k-traveling repairman problem, in: Proc. 14th Symposium on Discrete Algorithms (SODA), 2003, pp. 655-664
6. Fischetti M., Laporte G., and Martello S. The delivery man problem and cumulative matroids. Operations Research 41 (1993) 1064-1065
7. N. Garg, Saving an epsilon: A 2-approximation for the k-MST problem in graphs, in: Proc. 37th Symposium on Theory of Computing (STOC), 2005, pp. 396-402
8. M. Goemans, J. Kleinberg, An improved approximation ratio for the minimum latency problem, in: Proc. 7th Symposium on Discrete Algorithms (SODA), 1996, pp. 152-158
9. P. Gubbala, H. Pursnani, Personal communication, November 2003
10. R. Jothi, B. Raghavachari, Minimum latency tours and the k-traveling repairmen problem, in: Proc. Latin American Theoretical INformatics (LATIN), 2004, pp. 423-433
11. Minieka E. The delivery man problem on a tree network. Annals of Operations Research 18 1-4 (1989) 261-266
12. Sahni S., and Gonzales T. P-complete approximation problems. JACM 23 3 (1976) 555-565
13. R. Sitters, The minimum latency problem is NP-hard for weighted trees, in: Proc. 9th Conference on Integer Programming and Combinatorial Optimization (IPCO), 2002, pp. 230-239
14. T. Will, Extremal results and algorithms for degree sequences of graphs, Ph.D. Thesis, Univ. of Illinois at Urbana-Champaign, 1993