Covering graphs using trees and stars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2764, Issue , 2003, Pages 24-35

  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

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; FORESTRY; GRAPH THEORY; OPTIMIZATION; STARS;

CONSTANT-FACTOR APPROXIMATION ALGORITHMS; GRAPH G; K-TREES; MINIMUM COST TREES; POSITIVE INTEGERS; TREE COVER;

TREES (MATHEMATICS);

EID: 35248826016     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_3     Document Type: Article

References (16)

1. E. Arkin, R. Hassin and A. Levin. Approximations for minimum and min-max vehicle routing problems. Manuscript, 2003.
2. rd Annual ACM Symposium on Theory of Computing, 11-20, 2001.
3. rd Annual ACM Symposium on Theory of Computing, 1-10, 2001.
4. th Annual ACM-SIAM Symposium on Discrete Algorithms, 875-876, 1999.
5. R. Diestel. Graph Theory, Springer-Verlag, Berlin, 2000.
6. M. Dyer and A. Frieze. A simple heuristic for the p-center problem. Operations Research Letters, 3(6):285-288, 1985.
7. th Annual ACM-SIAM Symposium on Discrete Algorithms, 655-664, 2003.
8. G.N. Frederickson, M.S. Hecht and C.E. Kim. Approximation algorithms for some routing problems. SIAM J. Computing 7:178-193, 1978.
9. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979.
10. N. Guttman-Beck and R. Hassin. Approximation algorithms for min-sum p-clustering. Discrete Applied Mathematics, 89:125-142, 1998.
11. M. Haimovich, A. Rinnooy Kan and L. Stougie. Vehicle Routing: Methods and Studies, Elsevier, 1988.
12. D. Hochbaum and D. Shmoys. A best possible approximation algorithm for the k-center problem. Mathematics of Operations Research, 10(2):180-184, 1985.
13. A. Levin, private communication, May 2003.
14. th Annual ACM Symposium on Theory of Computing, 265-274, 1997.
15. D. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming A, 62:461-474, 1993.
16. P. Toth and D. Vigo (editors). The Vehicle Routing Problem, SIAM monographs on discrete mathematics and applications, 2002.