Improved combinatorial approximation algorithms for the k-level facility location problem

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 1, 2004, Pages 207-217

  Ageev, Alexander ^a   Yinyu, Y E ^b   Zhang, Jiawei ^b  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b Stanford University   (United States)

Author keywords

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

Indexed keywords

APPROXIMATION ALGORITHMS; FACILITY LOCATION; PERFORMANCE GUARANTEE; POLYNOMIAL-TIME REDUCTION;

APPROXIMATION THEORY; GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

ALGORITHMS;

EID: 14644390231     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480102417215     Document Type: Article

References (13)

1. K. AARDAL, F. A. CHUDAK, AND D. B. SHMOYS, A 3-approximation algorithm for the k-level uncapacitated facility location problem, Inform. Process. Lett., 72 (1999), pp. 161-167.
2. A. A. AGEEV, Improved approximation algorithms for multilevel facility location problems, Oper. Res. Lett., 30 (2002), pp. 327-332.
3. A. F. BUMB AND 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, Lecture Notes in Comput. Sci. 2129, Springer, Berlin, 2001, pp. 55-62.
4. N. EDWARDS, Approximation Algorithms for the Multi-Level Facility Location Problem, Ph.D. thesis, School of Operations Research and Industrial Engineering, Cornell University, Ithica, NY, 2001.
5. E. KH. GIMADI, private communication.
6. S. GUHA, Approximation Algorithms for Facility Location Problems, Ph.D. thesis, Stanford University, Stanford, CA, 2000.
7. S. GUHA AND S. KULLER, Greedy strikes back: Improved facility location algorithms, J. Algorithms, 31 (1999), pp. 228-248.
8. S. GUHA, A. MEYERSON, AND K. MUNAGALA, Hierarchical placement and network design problems, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000, pp. 603-612.
9. K. JAIN, M. MAHDIAN, AND A. SABERI, A new greedy approach for facility location problems, in Proceedings of the 34th ACM Symposium on Theory of Computing, Montreal, QC, Canada, 2002, pp. 731-740.
10. K. JAIN, M. MAHDIAN, E. MARKAKIS, AND A. SABERI, Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP, J. ACM, 50 (2003), pp. 795-824.
11. M. MAHDIAN, Y. YE, AND J. ZHANG, Improved approximation algorithms for metric facility location problems, in Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization, Lecture Notes in Comput. Sci. 2462, Springer, Berlin, 2002, pp. 229-242.
12. A. MEYERSON, K. MUNAGALA, AND S. PLOTKIN, Cost-distance: Two-metric network design, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000, pp. 624-630.
13. D. B. SHMOYS, Approximation algorithms for facility location problems, in Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization, Lecture Notes in Comput. Sci. 1913, Springer, Berlin, 2000, pp. 27-33.