Improved approximation algorithms for capacitated facility location problems

Mathematical Programming

Volumn 102, Issue 2, 2005, Pages 207-222

  Chudak, Fabián A ^a   Williamson, David P ^b  

^a ETH ZURICH   (Switzerland)

^b Cornell University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC METHODS; MATHEMATICAL PROGRAMMING; POLYNOMIALS;

APPROXIMATION ALGORITHMS; CAPACITATED FACILITY LOCATION PROBLEM (CFLP); POLYNOMIAL-TIME ALGORITHM;

PROBLEM SOLVING;

EID: 21144433375     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-004-0524-9     Document Type: Article

References (23)

1. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993
2. Arora, S., Sudan, M.: Improved low-degree testing and its applications. In: Proceedings of the 29th ACM Symposium on Theory of Computing, 1997, pp. 485-495
3. Babayev, Dj.A.: Comments on the note of Frieze. Math. Program. 7, 249-252 (1974)
4. Barahona, F., Jensen, D.: Plant location with minimum inventory. Math. Program. 83, 101-111 (1998)
5. Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location and k-median problems. In: Proceedings of the 40th IEEE Symposium on the Foundations of Computer Science, 1999, pp. 378-388
6. Chudak, F.: Improved approximation algorithms for uncapacitated facility location. In: Proceedings of the 6th IPCO Conference, 1998, pp. 180-194
7. Chudak, F., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33, 1-25 (2003)
8. Chudak, F., Shmoys, D.B.: Improved approximation algorithms for a capacitated facility location problem. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 875-876
9. Chudak, F., Williamson, D.P.: Improved approximation algorithms for capacitated facility location problems. In: Proceedings of the 7th IPCO Conference, 1999, pp. 99-113
10. Cornuéjols, G., Nemhauser, G., Wolsey, L.: The uncapacitated facility location problem. In: P. Mirchandani and R. Francis, (eds.), Discrete Location Theory, John Wiley and Sons, Inc., New York, 1990, pp. 119-171
11. Feige, U.: A threshold of Inn for approximating set-cover. J. ACM 45, 634-652 (1998)
12. Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithms 31, 228-248 (1999)
13. Korupolu, M., Plaxton, C., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. J. Algorithms 37, 146-188 (2000)
14. Lawler, E.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, New York, 1976
15. Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41, 960-981 (1994)
16. Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization, 2002, pp. 229-242
17. Mahdian, M., Ye, Y., Zhang, J.: A 2-approximation algorithm for the soft-capacitated facility location problem. In: Proceedings of the 6th International Workshop on Approximation Algorithms for Combinatorial Optimization, 2003, pp. 129-140
18. Mirchandani, P., Francis, R., eds.: Discrete Location Theory. John Wiley and Sons, Inc., New York, 1990
19. Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions - I. Math. Program. 14, 265-294 (1978)
20. Pal, M., Tardos, É., Wexler, T.: Facility location with nonuniform hard capacities. In: Proceedings of the 41st IEEE Symposium on the Foundations of Computing, 2001, pp. 329-338
21. Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the 29th ACM Symposium on Theory of Computing, 1997, pp. 475-484
22. Shmoys, D., Tardos, É, Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the 29th ACM Symposium on Theory of Computing, 1997, pp. 265-274
23. Sviridenko, M.: Personal communication, July, 1998