New approximation algorithms for the unsplittable capacitated facility location problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7357 LNCS, Issue , 2012, Pages 237-248

  Behsaz, Babak ^a   Salavatipour, Mohammad R ^a   Svitkina, Zoya ^b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b GOOGLE INC   (United States)

Author keywords

approximation algorithms; Euclidean metrics; unsplittable capacitated facility location problem

Indexed keywords

BI-CRITERIA; BICRITERIA APPROXIMATION; CAPACITATED FACILITY LOCATION PROBLEMS; CAPACITY CONSTRAINTS; EUCLIDEAN METRICS; FACILITY LOCATION PROBLEM; NP-HARD; QUASI-POLYNOMIAL TIME;

POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 84863110404     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31155-0_21     Document Type: Conference Paper

References (10)

1. Aggarwal, A., Anand, L., Bansal, M., Garg, N., Gupta, N., Gupta, S., Jain, S.: A 3-Approximation for Facility Location with Uniform Capacities. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 149-162. Springer, Heidelberg (2010)
2. Arora, S.: Polynomial time approximation schemes for euclidean tsp and other geometric problems. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science. pp. 2-12 (1996)
3. Bateni, M., Hajiaghayi, M.: Assignment problem in content distribution networks: unsplittable hard-capacitated facility location. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 805-814 (2009)
4. Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. In: SODA 1998: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 649-657 (1998)
5. Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1998, pp. 1-10 (1998)
6. Li, S.: A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 77-88. Springer, Heidelberg (2011)
7. Mahdian, M., Ye, Y., Zhang, J.: A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 129-140. Springer, Heidelberg (2003)
8. Shmoys, D., Tardos, E.: An approximation algorithm for the generalized assignment problem. Mathematical Programming 62(3), 461-474 (1993)
9. Shmoys, D., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 265-274 (1997)
10. Zhang, J., Chen, B., Ye, Y.: A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol. 3064, pp. 219-233. Springer, Heidelberg (2004)