A 3-approximation for facility location with uniform capacities

Authors:
Ankit Aggarwal;L. Anand;Manisha Bansal;Naveen Garg;Neelima Gupta;Shubham Gupta;Surabhi Jain
Affiliations:
Tower Research Capital LLC, Gurgaon;Georgia Tech;University of Delhi;Indian Institute of Technology Delhi;University of Delhi;U. of Waterloo;Morgan Stanley, Mumbai
Venue:
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Year:
2010

Citing 5
Cited 3

Analysis of a local search heuristic for facility location problems

Journal of Algorithms
Facility Location with Nonuniform Hard Capacities

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Local Search Heuristics for k-Median and Facility Location Problems

SIAM Journal on Computing
Improved approximation algorithms for capacitated facility location problems

Mathematical Programming: Series A and B
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem

Mathematics of Operations Research

New approximation algorithms for the unsplittable capacitated facility location problem

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
A 5-approximation for capacitated facility location

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Optimizing client assignment for enhancing interactivity in distributed interactive applications

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

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\sqrt{2}$ for the same algorithm. We also provide an example which shows that our analysis is tight.