## Improved Combinatorial Algorithms for the Facility Location and k-Median Problems (1999)

### Cached

### Download Links

- [theory.stanford.edu]
- [www.cis.upenn.edu]
- CiteULike
- DBLP

### Other Repositories/Bibliography

Venue: | In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science |

Citations: | 207 - 14 self |

### BibTeX

@INPROCEEDINGS{Charikar99improvedcombinatorial,

author = {Moses Charikar and Sudipto Guha},

title = {Improved Combinatorial Algorithms for the Facility Location and k-Median Problems},

booktitle = {In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science},

year = {1999},

pages = {378--388}

}

### Years of Citing Articles

### OpenURL

### Abstract

We present improved combinatorial approximation algorithms for the uncapacitated facility location and k-median problems. Two central ideas in most of our results are cost scaling and greedy improvement. We present a simple greedy local search algorithm which achieves an approximation ratio of 2:414 + in ~ O(n 2 =) time. This also yields a bicriteria approximation tradeoff of (1 +; 1+ 2=) for facility cost versus service cost which is better than previously known tradeoffs and close to the best possible. Combining greedy improvement and cost scaling with a recent primal dual algorithm for facility location due to Jain and Vazirani, we get an approximation ratio of 1.853 in ~ O(n 3 ) time. This is already very close to the approximation guarantee of the best known algorithm which is LP-based. Further, combined with the best known LP-based algorithm for facility location, we get a very slight improvement in the approximation factor for facility location, achieving 1.728....