A new approximation algorithm for the multilevel facility location problem

Discrete Applied Mathematics

Volumn 158, Issue 5, 2010, Pages 453-460

  Gabor, Adriana F ^a   van Ommeren, Jan Kees C W ^b  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Approximation algorithms; Facility location; Randomized algorithms

Indexed keywords

FACILITY LOCATION PROBLEM; FACILITY LOCATIONS; INTEGER PROGRAMMING FORMULATIONS; LINEAR PROGRAMS; LP-ROUNDING; POLYNOMIAL NUMBER; RANDOMIZED ALGORITHMS;

FACILITIES; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 75449119640     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.11.007     Document Type: Article

References (22)

1. Aardal K., Labbé M., Leung J., and Queyranne M. On the two-level uncapacitated facility location problem. INFORMS J. Comput. 8 (1996) 289-301
2. Aardal K., Chudak F.A., and Shmoys D.B. A 3-approximation algorithm for the k-level uncapacitated facility location problem. Inf. Process. Lett. 72 5-6 (1999) 161-167
3. Ageev A. Improved approximation algorithms for multilevel facility location problems. Oper. Res. Lett. 30 5 (2002) 327-332
4. Ageev A.A., Ye Y., and Zhang J. Improved combinatorial approximation algorithms for the k-level facility location problem. SIAM J. Discrete Math. 18 1 (2004) 207-217
5. V. Arya, N. Garg, R. Khandekar, V. Pandit, A. Meyerson, K. Munagala, Local search heuristics for k-median and facility location problems, in: Proceedings of the 33rd ACM Symposium on Theory of Computing, 2001, pp. 21-29
6. Bumb A.F., and Kern W. A simple dual ascent algorithm for the multilevel facility location problem. Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization. LNCS vol. 2129 (2001), Springer 55-62
7. Byrka J. An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. Proceedings of the 10th International Workshop APPROX 2007 and 11th International Workshop RANDOM 2007. LNCS vol. 4627 (2007), Springer 29-43
8. M. Charikar, S. Guha, Improved combinatorial algorithms for the facility location problem and k-median location problems, in: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 378-388
9. Chudak F.A., and Shmoys D.B. Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33 1 (2003) 1-25
10. Cornuejols G., Nemhauser G.L., and Wolsey L.A. The uncapacitated facility location problem. In: Mirchandani P., and Francis R. (Eds). Discrete Location Theory (1990), John Wiley and Sons, New York 119-171
11. N. Edwards, Approximation algorithms for the multilevel facility location problem, Ph.D. Thesis, School of operations Research and Industrial engineering, Cornell University, Ithaca, NY, 2001
12. Guha S., and Khuller S. Greedy strikes back: Improved facility location algorithms. J. Algorithms 31 1 (1999) 228-248
13. S. Guha, A. Meyerson, K. Munagala, Hierarchical placement and network design problems, in: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer science, 2000, pp. 603-612
14. Jain K., and Vazirani V. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48 (2001) 274-296
15. Jain K., Mahdian M., Markakis E., Saberi A., and Vazirani V.V. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50 6 (2003) 795-824
16. Korupolu M.R., Plaxton C.G., and Rajaraman R. Analysis of a local search heuristic for facility location problems. J. Algorithms 37 (2000) 146-188
17. Mahdian M., Ye Y., and Zhang J. Approximation algorithms for metric facility location problems. SIAM J. Comput. 36 2 (2006) 411-432
18. A. Meyerson, K. Munagala, S. Plotkin, Cost-distance: Two-metric network design, in: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 624-630
19. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge University Press
20. Shmoys D. Approximation algorithms for facility location problems. Proceedings of 3rd International Workshop of Approximation Algorithms for Combinatorial Optimization. Springer-Verlag LNCS vol. 1913 (2000) 27-33
21. D. Shmoys, E. Tardos, K. Aardal, Approximation algorithms for facility location problems, in: Proceedings of the 29th ACM Symposium on Theory of Computing, 1997, pp. 265-274
22. Zhang J. Approximating the two-level facility location problem via a quasi-greedy approach. Math. Program. 108 1 (2006) 159-176