References
- Shmoys DB, Tardös É, Aardal KI. Approximation algorithms for facility location problems. In: Proceedings of STOC; El Paso (TX); 1997. p. 265–274.
- Jain K, Vazirani VV. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM. 2001;48:274–296.
- Li S. A 1.488-approximation algorithm for the uncapacitated facility location problem. In: Proceedings of ICALP, Part II; 2011. p. 77–88.
- Guha S, Khuller S. Greedy strike back: improved facility location algorithms. J. Algorithm. 1999;31:228–248.
- Sviridenko M, cited as personal communication in [20], 1998 Jul.
- Ageev A, Ye Y, Zhang J. Improved combinatorial approximation algorithms for the k-level facility location problem. SIAM J. Discrete Math. 2004;18:207–217.
- Chen X, Chen B. Approximation algorithms for soft-capacitated facility location in capacitated network design. Algorithmica. 2007;53:263–297.
- Shu J. An efficient greedy heuristic for warehouse-retailer network design optimization. Transp. Sci. 2010;44:183–192.
- Shu J, Teo CP, Max Shen ZJ. Stochastic transportation-inventory network design problem. Oper. Res. 2005;53:48–60.
- Zhang J. Approximating the two-level facility location problem via a quasi-greedy approach. Math. Program. 2006;108:159–176.
- Zhang J, Chen B, Ye Y. A multiexchange local search algorithm for the capacitated facility location problem. Math. Oper. Res. 2005;30:389–403.
- Zhang P. A new approximation algorithm for the k-facility location problem. Theor. Comput. Sci. 2007;384:126–135.
- Ravi R, Sinha A. Hedging uncertainty: approximation algorithms for stochastic optimization problems. Math. Program. 2006;108:97–114.
- Mahdian M. Facility location and the analysis of algorithms through factor-revealing programs [Ph.D. dissertation]. Cambridge, MA: MIT; 2004.
- Ye Y, Zhang J. An approximation algorithm for the dynamic facility location problem. In: Cheng MX, Li Y, Du D-Z, editors. Combinatorial optimization in communication networks. Dordrecht (The Netherlands): Kluwer Academic; 2005. p. 623–637.
- Charikar M, Khuller S, Mount DM, Narasimhan G. Algorithms for facility location problems with outliers. In: Proceedings of SODA; Washington (DC); 2001. p. 642–651.
- Hayrapetyan A, Swamy C, Tardös É. Network design for information networks. In: Proceedings of SODA; Vancouver (BC); 2005. p. 933–942.
- Du D, Lu R, Xu D. A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica. 2012;63:191–200.
- Fleischer L, Iwata S. A push-relabel framework for submodular function minimization and applications to parametric optimization. Discrete Appl. Math. 2003;131:311–322.
- Chudak FA, Shmoys DB. Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 2003;33:1–25.