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

DOI10.1145/1060590.1060656zbMath1192.90104WikidataQ58051185 ScholiaQ58051185MaRDI QIDQ3581403

Abraham D. Flaxman, Juan Carlos Vera, Alan M. Frieze

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1060590.1060656

Mathematics Subject Classification ID

68W40: Analysis of algorithms

90C60: Abstract computational complexity for mathematical programming problems

90B80: Discrete location and assignment

68W25: Approximation algorithms