Approximation algorithms for the priority facility location problem with penalties

This paper considers the priority facility location problem with penalties. The authors develop a primal-dual 3-approximation algorithm for this problem. Combining with the greedy augmentation procedure, the authors further improve the previous ratio 3 to 1.8526.

[1]  David B. Shmoys,et al.  Approximation algorithms for facility location problems , 2000, APPROX.

[2]  Xing Wang,et al.  An approximation algorithm for the k-level capacitated facility location problem , 2010, J. Comb. Optim..

[3]  Jiawei Zhang.  Approximating the two-level facility location problem via a quasi-greedy approach , 2004, SODA '04.

[4]  Jinhui Xu,et al.  An LP rounding algorithm for approximating uncapacitated facility location problem with penalties , 2005, Inf. Process. Lett..

[5]  Shi Li.  A 1.488 approximation algorithm for the uncapacitated facility location problem , 2013, Inf. Comput..

[6]  Yinyu Ye,et al.  A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem , 2005, Math. Oper. Res..

[7]  Vijay V. Vazirani,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.

[8]  Sudipto Guha,et al.  Improved Combinatorial Algorithms for Facility Location Problems , 2005, SIAM J. Comput..

[9]  Gaidi Li,et al.  Approximation algorithms for the stochastic priority facility location problem , 2013 .

[10]  Fabián A. Chudak,et al.  Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization , 2007, SODA '07.

[11]  Chaitanya Swamy,et al.  Network design for information networks , 2005, SODA '05.

[12]  Dachuan Xu,et al.  A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties , 2011, Algorithmica.

[13]  Jiawei Zhang,et al.  Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem , 2004, SIAM J. Discret. Math..

[14]  Xujin Chen,et al.  Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design , 2007, Algorithmica.

[15]  R. Ravi,et al.  Multicommodity facility location , 2004, SODA '04.

[16]  Peng Zhang,et al.  A new approximation algorithm for the k-facility location problem , 2006, Theor. Comput. Sci..

[17]  Jinhui Xu,et al.  An improved approximation algorithm for uncapacitated facility location problem with penalties , 2005, J. Comb. Optim..

[18]  Samir Khuller,et al.  Greedy strikes back: improved facility location algorithms , 1998, SODA '98.

[19]  Jia Shu,et al.  An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization , 2010, Transp. Sci..

[20]  Samir Khuller,et al.  Algorithms for facility location problems with outliers , 2001, SODA '01.