Min-max tree covers of graphs

Operations Research Letters

Volumn 32, Issue 4, 2004, Pages 309-315

  Even, G ^a   Garg, N ^b   Konemann J ^c   Ravi, R ^c   Sinha, A ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Clustering; Graphs; Location routing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; POLYNOMIALS; SET THEORY; THEOREM PROVING; TRAVELING SALESMAN PROBLEM;

APPROXIMATION ALGORITHMS; CLUSTERING; GRAPHS; LOCATION ROUTING;

TREES (MATHEMATICS);

EID: 2042506399     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2003.11.010     Document Type: Article

References (8)

1. E. Arkin, R. Hassin, A. Levin, Approximations for minimum and min-max vehicle routing problems, manuscript, 2003.
2. Diestel R. Graph Theory. 2000;Springer, Berlin.
3. J. Fakcharoenphol, C. Harrelson, S. Rao, The k -traveling repairman problem, in: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 655-664.
4. Frederickson G.N., Hecht M.S., Kim C.E. Approximation algorithms for some routing problems. SIAM J. Comput. 7:1978;178-193.
5. Garey M., Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;W.H. Freeman, San Francisco.
6. Guttmann-Beck N., Hassin R. Approximations algorithms for min-max tree partition. J. Algorithms. 24:1997;266-286.
7. M. Haimovich, A. Rinnooy Kan, L. Stougie, Analysis of heuristics for vehicle routing problems, in: B.L. Golden, A.A. Assad (Eds.), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, 1988.
8. P. Toth, D. Vigo (Eds.), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, PA, 2002.