Probabilistic analysis of a relaxation for the k-median problem

e-approximations with minimum packing constraint violation (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing

On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location

WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms

Fast bounding procedures for large instances of the Simple Plant Location Problem

Computers and Operations Research

Approximation algorithms for the k-median problem

Efficient Approximation and Online Algorithms

Near-optimal solutions to large-scale facility location problems

Discrete Optimization