A 5-approximation for capacitated facility location

Authors:
Manisha Bansal;Naveen Garg;Neelima Gupta
Affiliations:
University of Delhi, India;Indian Institute of Technology Delhi, India;University of Delhi, India
Venue:
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Year:
2012

Citing 5
Cited 0

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
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
A 3-approximation for facility location with uniform capacities

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose and analyze a local search algorithm for the capacitated facility location problem. Our algorithm is a modification of the algorithm proposed by Zhang et al. [7] and improves the approximation ratio from 5.83 to 5. We achieve this by modifying the close, open and multi operations. The idea of taking linear combinations of inequalities used in Aggarwal et al.[1] is crucial in achieving this result. The example proposed by Zhang et al. also shows that our analysis is tight.