Improved approximation algorithms for multilevel facility location problems

We show that the metric multilevel facility location problem is polynomial-time reducible within a factor of 3 to the metric uncapacitated facility location problem. This leads to a combinatorial 4.83-approximation algorithm for the metric multilevel facility location problem and to a 9-approximation algorithm for a capacitated version of it.

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

[2]  Kamesh Munagala,et al.  Local search heuristic for k-median and facility location problems , 2001, STOC '01.

[3]  Amin Saberi,et al.  A new greedy approach for facility location problems , 2002, STOC '02.

[4]  Evangelos Markakis,et al.  A Greedy Facility Location Algorithm Analyzed Using Dual Fitting , 2001, RANDOM-APPROX.

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

[6]  Jiawei Zhang,et al.  Approximation algorithms for facility location problems , 2004 .

[7]  W. Kern,et al.  A simple dual ascent algorithm for the multilevel facility location problem , 2001, Electron. Notes Discret. Math..

[8]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

[10]  Mikkel Thorup.  Quick k-Median, k-Center, and Facility Location for Sparse Graphs , 2001, ICALP.

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

[12]  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).

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

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

[15]  Adriana Felicia Gabor,et al.  A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem , 2001, RANDOM-APPROX.

[16]  Mohammad Mahdian,et al.  A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem , 2003, RANDOM-APPROX.

[17]  Kamesh Munagala,et al.  Cost-distance: two metric network design , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[18]  David Shmoys,et al.  Approximation algorithms for the multi-level facility location problem , 2001 .

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

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

[21]  Fabián A. Chudak.  Improved Approximation Algorithms for Uncapitated Facility Location , 1998, IPCO.