Minimum restricted diameter spanning trees

Discrete Applied Mathematics

Volumn 137, Issue 3, 2004, Pages 343-357

  Hassin, Refael ^a   Levin, Asaf ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Combinatorial optimization; Minimum diameter spanning trees

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; MINIMUM DIAMETER SPANNING TREES;

TREES (MATHEMATICS);

EID: 1242287857     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00360-3     Document Type: Article

References (12)

1. Alon N., Karp R., Peleg D., West D. A graph theoretic game and its application to the. k -server problem SIAM J. Comput. 24:1995;78-100.
2. Y. Bartal, Probabilistic approximation of metric spaces and its algorithmic applications, Proceedings of FOCS 1996, pp. 184-193.
3. Y. Bartal, On approximating arbitrary metrics by tree metrics, Proceedings of STOC 1998, pp. 161-168.
4. M. Charikar, C. Chekuri, A. Goel, S. Guha, Rounding via trees: deterministic approximation algorithms for group steiner trees and k -median, Proceedings of STOC 1998, pp. 114-123.
5. Garey M.R., Johnson D.S. Computers and Intractability: a Guide to the Theory of NP-completeness. 1979;W.H. Freeman and Company, San Francisco, CA.
6. A. Gupta, Steiner points in tree metrics don't (really) help, Proceeding of SODA 2001, pp. 220-227.
7. Harary F. Graph Theory. 1969;Addison-Wesley, Reading, MA.
8. Hassin R., Tamir A. On the minimum diameter spanning tree problem, IPL. 53:1995;109-111.
9. Khuller S., Raghavachari B., Young N. Designing multi-commodity flow trees. Inform. Process. Lett. 50:1994;49-55.
10. D. Peleg, E. Reshef, Deterministic polylog approximation for minimum communication spanning trees, Proceedings of ICALP 1998, Lecture Notes in Computer Science, Vol. 1443, pp. 670-681.
11. Seymour P., Thomas R. Call routing and the rat catcher. Combinatorica. 14:1994;217-241.
12. A. Tamir, private communication, 2001.