A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties

We consider the facility location problem with submodular penalties (FLPSP), introduced by Hayrapetyan et al. (Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 933–942, 2005), who presented a 2.50-approximation algorithm that is non-combinatorial because this algorithm has to solve the LP-relaxation of an integer program with exponential number of variables. The only known polynomial algorithm for this exponential LP is via the ellipsoid algorithm as the corresponding separation problem for its dual program can be solved in polynomial time. By exploring the properties of the submodular function, we offer a primal-dual 3-approximation combinatorial algorithm for this problem.

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

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

[3]  Éva Tardos,et al.  Approximation algorithms for facility location problems (extended abstract) , 1997, STOC '97.

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

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

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

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

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

[9]  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.

[10]  Maxim Sviridenko.  An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem , 2002, IPCO.

[11]  Satoru Iwata,et al.  A push-relabel framework for submodular function minimization and applications to parametric optimization , 2003, Discret. Appl. Math..

[12]  Dachuan Xu,et al.  Approximation algorithm for facility location with service installation costs , 2008, Oper. Res. Lett..

[13]  Dachuan Xu,et al.  The k-level facility location game , 2006, Oper. Res. Lett..

[14]  Mohammad Mahdian,et al.  Approximation Algorithms for Metric Facility Location Problems , 2006, SIAM J. Comput..

[15]  Evangelos Markakis,et al.  Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP , 2002, JACM.

[16]  Jaroslaw Byrka,et al.  An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem , 2006, SIAM J. Comput..

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

[18]  Karen Aardal,et al.  A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem , 1999, Inf. Process. Lett..

[19]  Sudipto Guha,et al.  Improved combinatorial algorithms for the facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

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

[21]  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.

[22]  Fabián A. Chudak,et al.  Improved Approximation Algorithms for the Uncapacitated Facility Location Problem , 2003, SIAM J. Comput..

[23]  Rajmohan Rajaraman,et al.  Analysis of a local search heuristic for facility location problems , 2000, SODA '98.