A 3-approximation algorithm for the k-level uncapacitated facility location problem

Information Processing Letters

Volumn 72, Issue 5-6, 1999, Pages 161-167

  Aardal, Karen ^a   Chudak, Fabián A ^b   Shmoys, David B ^c  

^a UTRECHT UNIVERSITY   (Netherlands)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c Cornell University   (United States)

Author keywords

Approximation algorithm; Facility location; Randomized rounding

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMMUNICATION CHANNELS (INFORMATION THEORY); CONGESTION CONTROL (COMMUNICATION); COSTS; LINEAR PROGRAMMING; RELAXATION PROCESSES; TELECOMMUNICATION TRAFFIC;

APPROXIMATION ALGORITHMS; RANDOMIZED ROUNDING METHODS;

CLIENT SERVER COMPUTER SYSTEMS;

EID: 0033280967     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(99)00144-1     Document Type: Article

References (15)

1. K. Aardal, M. Labbé, J. Leung, M. Queyranne, On the two-level uncapacitated facility location problem, INFORMS J. Comput. 8 (1996) 289-301.
2. A.I.M.B. de Barros, Discrete and fractional programming techniques for location problems, Ph.D. Thesis, Erasmus Universiteit Rotterdam, Tinbergen Institute Research Series No. 89, Thesis Publishers, Amsterdam, 1995.
3. F.A. Chudak, Improved approximation algorithms for uncapacitated facility location, in: R.E. Bixby, E.A. Boyd, R.Z. Ríos-Mercado (Eds.), Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Lecture Notes in Comput. Sci., Vol. 1412, Springer, Berlin, 1998, pp. 180-194.
4. F.A. Chudak, D.B. Shmoys, Improved approximation algorithms for the uncapacitated facility location problem, Manuscript, 1999.
5. G. Cornuéjols, M.L. Fisher, G.L. Nemhauser, Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms, Management Sci. 8 (1977) 789-810.
6. G. Cornuéjols, G.L. Nemhauser, L.A. Wolsey, The uncapacitated facility location problem, in: P. Mirchandani, R. Francis (Eds.), Discrete Location Theory, John Wiley and Sons, Inc., New York, 1990, pp. 119-171.
7. D.E. Erlenkotter, A dual-based procedure for uncapacitated facility location, Oper. Res. 26 (1978) 992-1009.
8. M. Grötschel, L. Lovász, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, 1988.
9. S. Guha, S. Khuller, Greedy strikes back: improved facility location algorithms, in: Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 649-657.
10. L. Kaufman, M. Vanden Eede, P. Hansen, A plant and warehouse location problem, Oper. Res. Quarterly 28 (1977) 547-557.
11. P.B. Mirchandani, R.L. Francis (Eds.), Discrete Location Theory, John Wiley and Sons, Inc., New York, 1990.
12. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, 1995.
13. D.B. Shmoys, É. Tardos, K. Aardal, Approximation algorithms for facility location problems, in: 29th ACM Symposium on Theory of Computing, 1997, pp. 265-274.
14. D. Tcha, B. Lee, A branch-and-bound algorithm for the multi-level uncapacitated location problem, European J. Oper. Res. 18 (1984) 35-43.
15. T.J. Van Roy, D. Erlenkotter, A dual based procedure for dynamic facility location, Management Sci. 28 (1982) 1091-1105.