Approximating k-hop minimum-spanning trees

Operations Research Letters

Volumn 33, Issue 2, 2005, Pages 115-120

  Althaus, Ernst ^a   Funke, Stefan ^b   Har Peled, Sariel ^c   Könemann, Jochen ^d   Ramos, Edgar A ^c   Skutella, Martin ^b  

^a UNIVERSITÉ DE LORRAINE   (France)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^d UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Approximation algorithms; Depth restriction; Metric space approximation; Minimum spanning trees

Indexed keywords

ALGORITHMS; COSTS; DYNAMIC PROGRAMMING; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; DEPTH RESTRICTION; METRIC SPACE APPROXIMATION; MINIMUM SPANNING TREES;

APPROXIMATION THEORY;

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

References (16)

1. K.I. Aardal, F.A. Chudak, D.B. Shmoys, Improved approximation algorithms for the k-level facility location problem, Inform. Process. Lett. 72 (1999) 161-167.
2. L. Alfandari, V.T. Paschos, Approximating minimum spanning tree of depth two, Int. Trans. Oper. Res. 6 (1999) 607-622.
3. J. Bar-Ilan, G. Kortsarz, D. Peleg, Generalized submodular cover problems and applications, Theoret. Comput. Sci. 250 (1-2) (2001) 179-200.
4. Y. Bartal, Probabilistic approximation of metric spaces and its algorithmic applications, in: Proceedings, IEEE Symposium on Foundations of Computer Science, 1996, pp. 184-193.
5. Y. Bartal, On approximating arbitrary metrics by tree metrics, in: Proceedings, ACM Symposium on Theory of Computing, 1998, pp. 161-168.
6. S.E. Deering, D.R. Cheriton, Multicast routing in datagram internetworks and extended LANs, ACM Trans. Comput. Syst. 8 (2) (1990) 85.
7. S. Deering, D. Estrin, D. Farinacci, An architecture for wide-area multicast routing, in: Proceedings of SIGCOMM, 1994.
8. J. Fakcharoenphol, S. Rao, K. Talwar, A tight bound on approximating arbitrary metrics by tree metrics, in: Proceedings, ACM Symposium on Theory of Computing, 2003, pp. 448-455.
9. L. Gouveia, T.L. Magnanti, Network flow models for designing diameter-constrained minimum-spanning and steiner trees, Networks 41 (2003) 159-173.
10. S. Guha, S. Khuller, Greedy strikes back: Improved facility location algorithms, J. Algorithms 31 (1999) 228-248.
11. R. Hassin, A. Levin, Minimum spanning tree with hop restrictions, J. Algorithms 48 (2003) 220-238.
12. V.P. Kompella, J.C. Pasquale, G.C. Polyzos, Multicast routing for multimedia communication, IEEE/ACM Trans. Networks 1 (3) (1993) 286-292.
13. G. Kortsarz, D. Peleg, Approximating the weight of shallow steiner trees, DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, Vol. 93, 1999.
14. M. Mahdian, Y. Ye, J. Zhang, A 1.52-approximation algorithm for the uncapacitatcd facility location problem, in: Proceedings, International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2002, pp. 127-137.
15. M.V. Marathe, R. Ravi, R. Sundaram, S.S. Ravi, D.J. Rosenkrantz, H.B, Hunt III, Bicriteria network design problems, J. Algorithms 28 (1) (1998) 142-171.
16. J. Zhang, Approximating the two-level facility location problem via a quasi-greedy approach, Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004.