Improved approximation algorithms for multilevel facility location problems

Operations Research Letters

Volumn 30, Issue 5, 2002, Pages 327-332

  Ageev, A A ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

Approximation algorithm; Facility location; Performance guarantee; Polynomial time reduction

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS;

OPERATIONS RESEARCH;

EID: 0036795525     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(02)00162-1     Document Type: Article

References (19)

1. Aardal K.I., Chudak F., Shmoys D.B. A 3-approximation algorithm for the. k -level uncapacitated facility location problem Inform. Process. Lett. 72:1999;161-167.
2. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, V. Pandit, Local search heuristics for k-median and facility location problems, in: Proceedings of the 33rd ACM Symposium on Theory of Computing, ACM Press, New York, 2001, pp. 21-29.
3. A.F. Bumb, W. Kern, A simple dual ascent algorithm for the multilevel facility location problem, in: Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2001), Lecture Notes in Computer Science, Vol. 2129, Springer, Berlin, 2001, pp. 55-62.
4. M. Charikar, S. Guha, Improved combinatorial algorithms for facility location and k-median problems, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Silver Spring, MD, 1999, pp. 378-388.
5. M. Charikar, S. Khuller, D. Mount, G. Narasimhan, Facility location with outliers, in: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington DC, 2001, pp. 642-651.
6. F.A. Chudak, Improved approximation algorithms for uncapacited facility location, in: Proceedings of the 6th Integer Programming and Combinatorial Optimization Conference, Lecture Notes in Computer Science, Vol. 1412, Springer, Berlin, 1998, pp. 180-194.
7. F.A. Chudak, D.B. Shmoys, Improved approximation algorithms for the uncapacitated facility location problem, 1998, unpublished manuscript.
8. Dijkstra E.W. A note on two problems in connection with graphs. Numer. Math. 1:1959;269-271.
9. N.J. Edwards, Approximation algorithms for the multi-level facility location problem, Ph.D. Thesis, 2001; http://www.orie.cornell.edu/nedwards/thesis.oneside.ps.
10. Guha S., Khuller S. Greedy strikes back. improved facility location algorithms J. Algorithms. 31:1999;228-248.
11. K. Jain, M. Mahdian, A. Saberi, A new greedy approach for facility location problems, in: Proceedings of the 34th ACM Symposium on Theory of Computing Montreal, Quebec, Canada, May 19-21, 2002, to appear.
12. Jain K., Vazirani V.V. Approximation algorithms for metric facility location and. k -median problems using the primal-dual schema and Lagrangian relaxation J. ACM. 48:2001;274-296.
13. M.R. Korupolu, C.G. Plaxton, R. Rajaraman, Analysis of a local search heuristic for facility location problems, in: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98), ACM Press, New York, 1998, pp. 1-10.
14. M. Mahdian, Y. Ye, J. Zhang, A 1.52-approximation algorithm for the uncapacitated facility location problem, 2001, manuscript; http://www.math.mit.edu/̃mahdian/floc152.ps.
15. A. Meyerson, K. Munagala, S. Plotkin, Cost distance: two metric network design, in: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Silver Spring, MD, 2000, pp. 624-630.
16. D. Shmoys, E. Tardos, K.I. Aardal, Approximation algorithms for facility location problems, in: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC'97), ACM Press, New York, 1997, pp. 265-274.
17. M. Sviridenko, An improved approximation algorithm for the metric uncapacitated facility location problem, in: Proceedings of the 9th Integer Programming and Combinatorial Optimization Conference, Lecture Notes in Computer Science, Vol. 2337, Springer, Berlin, 2002, pp. 240-257.
18. M. Sviridenko, personal communication.
19. M. Thorup, Quick k-median, k-center, and facility location for sparse graphs, in: Automata, Languages and Programming, 28th International Colloquium (ICALP'2001), Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 249-260.