@InProceedings{10.1007/978-3-642-13036-6_12,
author="Aggarwal, Ankit
and Anand, L.
and Bansal, Manisha
and Garg, Naveen
and Gupta, Neelima
and Gupta, Shubham
and Jain, Surabhi",
editor="Eisenbrand, Friedrich
and Shepherd, F. Bruce",
title="A 3-Approximation for Facility Location with Uniform Capacities",
booktitle="Integer Programming and Combinatorial Optimization",
year="2010",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="149--162",
abstract="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{\backslash}sqrt{\{}2{\}}{\$}               for the same algorithm. We also provide an example which shows that our analysis is tight.",
isbn="978-3-642-13036-6"
}