A 3-Approximation for Facility Location with Uniform Capacities

We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of add, delete and swap and prove that any locally optimum solution is no more than 3 times the global optimum. This improves on a result of Chudak and Williamson who proved an approximation ratio of 3 + 2 √ 2 for the same algorithm. We also provide an example which shows that our analysis is tight.

• Type: Journal
• Year: 2010
• Where: IPCO
• Authors: Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain
• Keywords: Facility Location Problem, IPCO 2010, Local Search Algorithm, Optimization, Optimum Solution