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

A.D. Flaxman, A.F. Frieze, J.C. Vera

Research output: Chapter in Book/Report/Conference proceedingConference contributionProfessional

Original languageEnglish
Title of host publicationProceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), Baltimore, MD, USA, May 22-24, 2005
EditorsH.N. Gabow, R. Fagin
Place of PublicationNew York
PublisherACM Press
Pages441-449
Number of pages9
Volume37
ISBN (Print)1581139608
Publication statusPublished - 2005
Externally publishedYes

Publication series

Name
Volume37

Cite this

Flaxman, A. D., Frieze, A. F., & Vera, J. C. (2005). On the average case performance of some greedy approximation algorithms for the uncapacited facility location problem. In H. N. Gabow, & R. Fagin (Eds.), Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), Baltimore, MD, USA, May 22-24, 2005 (Vol. 37, pp. 441-449). ACM Press.